Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Abstract Constraint Logic Programming (CLP) is a merger of two declarative paradigms:
constraint solving and logic programming. Although a relatively new field, CLP has …

Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

Paradigms of AI Programming is the first text to teach advanced Common Lisp techniques in
the context of building major AI systems. By reconstructing authentic, complex AI programs …

This article surveys the major developments in sequential Prolog implementation during the
period 1983–1993. In this decade, implementation technology has matured to such a …

" Modern Compiler Design" makes the topic of compiler design more accessible by focusing
on principles and techniques of wide application. By carefully distinguishing between the …

Abstract Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient
and suitable for integrating theory reasoning. However, for numerous applications from …

We introduce Mercury, a new purely declarative logic programming language designed to
provide the support that groups of application programmers need when building large …

Functional and logic programming are the most important declarative programming
paradigms, and interest in combining them has grown over the last decade. Early research …

We describe a language for defining term rewriting strategies, and its application to the
production of program optimizers. Valid transformations on program terms can be described …