The unification problem and several variants are presented. Various algorithms and data
structures are discussed. Research on unification arising in several areas of computer …

This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …

A large number of problems in AI and other areas of computer science can be viewed as
special cases of the constraint-satisfaction problem. Some examples are machine vision …

The popular use of backtracking as a control strategy for theorem proving in PROLOG and in
Truth-Maintenance-Systems (TMS) led to increased interest in various schemes for …

Many AI tasks can be formulated as constraint-satisfaction problems (CSP), ie, the
assignment of values to variables subject to a set of constraints. While some CSPs are hard …

Researchers in the areas of constraint satisfaction problems, logic programming, and truth
maintenance systems have suggested various schemes for enhancing the performance of …

The satis ability (SAT) problem is a core problem in mathematical logic and computing
theory. In practice, SAT is fundamental in solving many problems in automated reasoning …

Many AI synthesis problems such as planning, scheduling or design may be encoded in a
constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding …

Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints
without specifying the method by which these constraints are to be satisfied. A variety of …

We present an overview of some techniques which have been proposed for the
transformation of logic programs. We consider the so-called “rules+ strategies” approach …