• Publications
  • Influence
Constraint logic programming
We address the problem of designing programming systems to reason with and about constraints. Expand
  • 1,483
  • 82
Whole-genome comparative analysis of three phytopathogenic Xylella fastidiosa strains
Xylella fastidiosa (Xf) causes wilt disease in plants and is responsible for major economic and crop losses globally. Owing to the public importance of this phytopathogen we embarked on a comparativeExpand
  • 103
  • 11
  • PDF
Unification Revisited
In the literature, unification is often treated as a simple and straightforward matter, even though it is recognized as a deep and fundamental concept. Expand
  • 411
  • 10
Explicit representation of terms defined by counter examples
Anti-unification guarantees the existence of a term which is an explicit representation of the most specific generalization of a collection of terms. Expand
  • 57
  • 9
Foundations of Deductive Databases and Logic Programming
Downloading the book in this website lists can give you more advantages. Expand
  • 258
  • 7
Fixed Point Theorems and Semantics: A Folk Tale
In this paper we search for the theorem on which the fixed point theory of recursion is based. Expand
  • 151
  • 5
Querying constraints
  • J. Lassez
  • Computer Science
  • PODS '90
  • 2 April 1990
In this paper, we show how one can design a querying system for sets of linear constraints by using basic concepts from logic programming and symbolic computation, as well as algorithms from linear programming and computational geometry. Expand
  • 63
  • 5
A Theory of Complete Logic Programs with Equality
We present here a general framework for logic programming with definite clauses, equality theories, and generalized unification. Expand
  • 131
  • 4
A Canonical Form for Generalized Linear Constraints
We develop a natural canonical form for the representation of linear arithmetic constraints and we design polynomial time algorithms for deciding solvability and generating the canonical form. Expand
  • 80
  • 4