Computational complexity and constraint logic programming languages

We give a complexity analysis of a variety of languages across the spectrum of the CLP scheme. By varying the logic and memory management, the role of the constraints and the role of the logic can be measured. The analysis clarifies the relation between linear/integer programming and constraint logic programming. We also determine how the power of constraints can easily lead to undecidable queries in Datalog languages with constraints. This work is motivated in large part by the problems of efficient implementation of CLP languages and the concomitant need for low level constraint languages.

[1]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[2]  Johann A. Makowsky,et al.  Embedded implicational dependencies and their inference problem , 1981, STOC '81.

[3]  Leslie E. Trotter,et al.  Hermite Normal Form Computation Using Modulo Determinant Arithmetic , 1987, Math. Oper. Res..

[4]  Giovanni Gallo,et al.  Efficient algorithms and bounds for Wu-Ritt characteristic sets , 1991 .

[5]  Alain Colmerauer,et al.  Opening the Prolog III universe , 1987 .

[6]  Dima Grigoriev,et al.  Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields , 1984, MFCS.

[7]  Jean-Louis Lassez,et al.  Applications of a Canonical Form of Gerneralized Linear Constraints , 1988, FGCS.

[8]  Joxan Jaffar,et al.  Methodology and Implementation of a CLP System , 1987, ICLP.

[9]  Mike Paterson,et al.  Linear Unification , 1978, J. Comput. Syst. Sci..

[10]  Jean-Louis Lassez,et al.  A Canonical Form for Generalized Linear Constraints , 1992, J. Symb. Comput..

[11]  Michael J. Maher.  Logic Semantics for a Class of Committed-Choice Programs , 1987, ICLP.

[12]  James Renegar,et al.  A faster PSPACE algorithm for deciding the existential theory of the reals , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[14]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[15]  Ehud Y. Shapiro.  Alternation and the Computational Complexity of Logic Programs , 1984, J. Log. Program..

[16]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[17]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[18]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[19]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[20]  Nicolas Beldiceanu,et al.  Constraint Logic Programming , 1997 .

[21]  Doug Ierardi,et al.  Quantifier elimination in the theory of an algebraically-closed field , 1989, STOC '89.

[22]  Akira Aiba,et al.  CAL: A Theoretical Background of Constraint Logic Programming and its Applications , 1988, J. Symb. Comput..

[23]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.

[24]  Ju. V. Matijasevic,et al.  ENUMERABLE SETS ARE DIOPHANTINE , 2003 .