Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints

We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint formulae for which both proposals provide suitable procedures for testing constraint satisfiability with respect to a given privileged interpretation. Specifically, we present a technique for reducing any set-constraint to a CLP(SET )-constraint; moreover, we show how the satisfiability check for some classes of set-constraints can be performed by the CLP(SET ) constraint solver.

[1]  Carmen Gervet,et al.  Conjunto: Constraint Logic Programming with Finite Set Domains , 1994, ILPS.

[2]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[3]  Witold Charatonik,et al.  Negative set constraints with equality , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[4]  Sophie Tison,et al.  Solving systems of set constraints with negated subset relationships , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  Joxan Jaffar,et al.  Set Constraints and Set-Based Analysis , 1994, PPCP.

[6]  Andreas Podelski,et al.  Solving set constraints for greatest models , 1997 .

[7]  Agostino Dovier,et al.  On the Representation and Management of Finite Sets in CLP Languages , 1998, IJCSLP.

[8]  Agostino Dovier,et al.  Embedding extensional finite sets in CLP , 1993, ILPS.

[9]  Alexander Aiken,et al.  The Complexity of Set Constraints , 1993, CSL.

[10]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[11]  Franz Baader,et al.  Combination of Constraint Solvers for Free and Quasi-Free Structures , 1998, Theor. Comput. Sci..

[12]  Agostino Dovier,et al.  Compiling Intensional Sets in CLP , 1994, ICLP.

[13]  A. Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994 .

[14]  Dexter Kozen.  Set Constraints and Logic Programming , 1994, CCL.

[15]  K. Stefansson,et al.  Systems of set constraints with negative constraints are NEXPTIME-complete , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[16]  Dexter Kozen.  Logical Aspects of Set Constraints , 1993, CSL.

[17]  Edmond Schonberg,et al.  Programming with Sets: An Introduction to SETL , 1986 .

[18]  Sophie Tison,et al.  Solving Systems of Set Constraints using Tree Automata , 1993, STACS.

[19]  Joachim Niehren,et al.  Inclusion Constraints over Non-empty Sets of Trees , 1997, TAPSOFT.

[20]  Joxan Jaffar,et al.  A finite presentation theorem for approximating logic programs , 1989, POPL '90.

[21]  Bruno Legeard,et al.  Short Overview of the CLPS System , 1991, PLILP.

[22]  Agostino Dovier,et al.  A Language for Programming in Logic with Finite Sets , 1996, J. Log. Program..