Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic description of the major trends in terms of common fundamental concepts. The three main parts cover the theory, implementation issues, and programming for applications.
|
1626
|
Foundations of Logic Programming
– Lloyd
- 1984
|
|
814
|
The temporal logic of programs
– Pnueli
- 1977
|
|
709
|
Constraint logic programming
– Jaffar, Lassez
- 1987
|
|
642
|
Foundation of Constraint Satisfaction
– Tsang
- 1993
|
|
542
|
Towards a Theory of Declarative Knowledge
– Apt, Blair, et al.
- 1988
|
|
407
|
Sketchpad, A Man-Machine Graphical Communication System
– Sutherland
- 1963
|
|
360
|
A Decision Method for Elementary Algebra and Geometry, 2nd Edition
– Tarski
- 1951
|
|
346
|
Constraint satisfaction in Logic programming
– Hentenryck
- 1989
|
|
324
|
A Kripke-Kleene Semantics for Logic Programs
– Fitting
- 1985
|
|
302
|
Graph based algorithms for boolean function manipulation
– Bryant
- 1986
|
|
265
|
The CLP(R) language and system
– Jaffar, Michaylov, et al.
- 1992
|
|
262
|
An introduction to PROLOGIII
– Colmerauer
- 1990
|
|
245
|
A Logic Programming Language with Lambda Abstraction, Function Variables, and Simple Unification
– Miller
- 1986
|
|
234
|
Domains for Denotational Semantics
– Scott
- 1982
|
|
225
|
On the Declarative Semantics of Deductive Databases and Logic Programs
– Rondogiannis, Przymusinski, et al.
- 1988
|
|
210
|
Negation in Logic Programming
– Kunen
- 1987
|
|
207
|
Unification revisited
– Lassez, Maher, et al.
- 1988
|
|
201
|
Warren's Abstract Machine: A Tutorial Reconstruction
– Ait-Kaci
- 1991
|
|
196
|
Unfounded Sets and Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1988
|
|
181
|
The programming language aspects of ThingLab, a constraint oriented simulation laboratory
– Borning, H
- 1981
|
|
177
|
Concurrent Constraint Programming Languages
– Saraswat
- 1993
|
|
150
|
Making Prolog more Expressive
– Lloyd, Topor
- 1984
|
|
140
|
Login: A logic programming language with built-in inheritance
– Ait-Kaci, Nasr
- 1986
|
|
135
|
The problem of solvability of equations in free semigroups
– Makanin
- 1977
|
|
132
|
The Design, Implementation, and Evaluation of the Constraint Language cc(FD), volume Constraint Programming: Basics and Trends
– Hentenryck, Saraswat, et al.
- 1995
|
|
130
|
Logic semantics for a class of committed-choice programs
– Maher
- 1987
|
|
130
|
Linear Unification
– Paterson, Wegman
- 1978
|
|
123
|
Complete axiomatizations of the algebras of finite, rational and infinite trees
– Maher
- 1988
|
|
120
|
Towards a meaning of life
– Ait-Kaci, Podelski
- 1993
|
|
120
|
Fundamental properties of infinite trees
– Courcelle
- 1983
|
|
119
|
Constructive Negation Based on the Completed Database
– Chan
- 1988
|
|
116
|
Negation as failure using tight derivations for general logic programs
– Gelder
- 1988
|
|
112
|
On conjunctive queries containing inequalities
– Klug
- 1988
|
|
111
|
Magic Templates: A spellbinding approach to logic programming
– Ramakrishnan
- 1988
|
|
111
|
Automated deduction by theory resolution
– Stickel
- 1985
|
|
111
|
Constructive Negation for Constraint Logic Programming
– Stuckey
- 1991
|
|
105
|
How good is the simplex algorithm
– Klee, Minty
- 1972
|
|
104
|
Unification theory
– Siekmann
- 1989
|
|
94
|
Equations and inequations on finite and infinite trees
– Colmerauer
- 1984
|
|
92
|
Average-case analysis of algorithms and data structures
– Vitter, Flajolet
- 1990
|
|
91
|
A polynomial algorithm in linear programming (in Russian
– Khachian
- 1979
|
|
85
|
Constraint logic programming languages
– Cohen
- 1990
|
|
85
|
Static Inference of Modes and Data Dependencies in Logic Programs
– Debray
- 1989
|
|
81
|
Temporal and Modal Logic. Handbook of Theoretical
– Emerson
- 1990
|
|
73
|
Quantitative Deduction and its Fixpoint Theory
– Emden
- 1986
|
|
72
|
Constraints: a Language for Expressing Almost Hierarchical Descriptions
– Sussman, Steele
- 1980
|
|
70
|
Prolog and infinite trees
– Colmerauer
- 1982
|
|
69
|
A feature-based constraint system for logic programming with entailment
– Ait-Kaci, Podelski, et al.
- 1994
|
|
68
|
Constraint satisfaction using constraint logic programming
– Hentenryck, Simonis, et al.
- 1992
|
|
67
|
A minimal extension of the WAM for clp(FD
– Diaz, Codognet
- 1993
|
|
