Finite Set Constraints in Oz

We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the const raint programming system Oz and are very employable in natural language processing and general problem solving. This extension profits much from its integration with the existi ng constraint systems over finite domains and feature trees, as well as from the availability of first-class pr ocedures. This combination of features is unique to Oz. This paper focuses on the expressiveness gained by set constraints and on the benefits of the integration with finite domain co nstraints. A number of case studies demonstrates programming techniques exploring these advantages.

[1]  Jörg Würtz,et al.  Extending a Concurrent Constraint Language by Propagators , 1997, ILPS.

[2]  Andreas Podelski,et al.  Set Constraints: A Pearl in Research on Constraints , 1997, CP.

[3]  Christian Schulte Oz Explorer: A Visual Constraint Programming Tool , 1996, PLILP.

[4]  Peter Van Roy,et al.  Integrating Efficient Records into Concurrent Constraint Programming , 1996, PLILP.

[5]  Jeffrey S. Foster CLP(SC): Implementation and Efficiency Considerations , 1996 .

[6]  Jj Org,et al.  A Survey on Finite Domain Programming in Oz , 1996 .

[7]  Frieder Stolzenburg,et al.  Membership-Constraints and Complexity in Logic Programming with Sets , 1996, FroCoS.

[8]  Gert Smolka,et al.  The Oz Programming Model , 1996, Computer Science Today.

[9]  Carmen Gervet,et al.  Set Intervals in Constraint Logic Programming: Definition and implementation of a language. (Intervalles ensemblistes en programmation logique par contraintes : définition formelle et concrète d'un langage) , 1995 .

[10]  Jens Palsberg,et al.  Safety Analysis versus Type Inference , 1992, Inf. Comput..

[11]  Dexter Kozen,et al.  Set Constraints and Logic Programming , 1994, Inf. Comput..

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

[13]  Suresh Manandhar,et al.  An Attributive Logic of Set Descriptions and Set Operations , 1994, ACL.

[14]  Gert Smolka,et al.  Encapsulated Search and Constraint Programming in Oz , 1994, PPCP.

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

[16]  Gert Smolka,et al.  Object-Oriented Concurrent Constraint Programming in Oz , 1993, KI.

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

[18]  Catriel Beeri,et al.  Set Constructors in a Logic Database Language , 1991, J. Log. Program..

[19]  Clifford Walinsky,et al.  CLP(Sigma*): Constraint Logic Programming with Regular Sets , 1989, ICLP.

[20]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[21]  Gabriel M. Kuper,et al.  Logic programming with sets , 1987, J. Comput. Syst. Sci..

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

[23]  Edith Schonberg,et al.  Programming with Sets , 1986, Texts and Monographs in Computer Science.