We address the problem of designing programming systems to reason with and about
constraints. Taking a logic programming approach, we define a class of programming …

An incremental constraint solver, the DeltaBlue algorithm maintains an evolving solution to
the constraint hierarchy as constraints are added and removed. DeltaBlue minimizes the …

We describe a paradigm for numerical computing, based on exact computation. This
emerging paradigm has many advantages compared to the standard paradigm which is …

We consider a bottom-up query-evaluation scheme in which facts of relations are allowed to
have nonground terms. The magic-sets query-rewriting technique is generalized to allow …

Constraint logic programming (CLP) is a general scheme for extending logic programming
to include constraints. It is parametrized by D, the domain of the constraints. However, CLP …

Notepad computers promise a new input paradigm where users communicate with
computers in visual languages composed of handwritten text and diagrams. A key problem …

A framework for first-order constrained deduction is proposed in this paper. The syntax and
semantics of symbolic constraints and constrained formulae are defined. Constrained …

Constraint Logic Programming (CLP) is a general scheme for extending logic programming
to include constraints. It is parameterized by D, the domain of the constraints. However, CLP …

We already presented two ways of handling equality within first order theories: First, by
giving an explicit set of first-order axioms and, second, by replacing the unification algorithm …

Argument size relationships are useful in termination analysis which, in turn, is important in
program synthesis and goal-replacement transformations. We show how a precise analysis …