Experiments in Reactive Constraint Logic Programming

Abstract In this paper we study a reactive extension of constraint logic programming (CLP). Our primary concerns are search problems in a dynamic environment, where interactions with the user (e.g. in interactive multi-criteria optimization problems) or interactions with the physical world (e.g. in time evolving problems) can be modeled and solved efficiently. Our approach is based on a complete set of query manipulation commands for both the addition and the deletion of constraints and atoms in the query. We define a fully incremental model of execution which, contrary to other proposals, retains as much information as possible from the last derivation preceding a query manipulation command. The completeness of the execution model is proved in a simple framework of transformations for CSLD derivations, and of constraint propagation seen as chaotic iteration of closure operators. A prototype implementation of this execution model is described and evaluated on two applications.

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

[2]  Francesca Rossi,et al.  NMCC Programming: Constraint Enforcement and Retracting in CC Programming , 1995, ICLP.

[3]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[4]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[5]  François Fages,et al.  Handling Preferences in Constraint Logic Programming with Relational Optimization , 1994, PLILP.

[6]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[7]  Leon S. Sterling,et al.  NMCC Programming: Constraint Enforcement and Retraction in CC Programming , 1995 .

[8]  Pascal Van Hentenryck,et al.  Design, Implementation, and Evaluation of the Constraint Language cc(FD) , 1994, Constraint Programming.

[9]  Pascal Van Hentenryck.  Incremental Constraint Satisfaction in Logic Programming , 1990, ICLP.

[10]  Pedro Barahona,et al.  Defeasible Constraint Solving , 1995, Over-Constrained Systems.

[11]  Jean-Louis Lassez.  Parametric queries, linear constraints and variable elimination , 1990, DISCO.

[12]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[13]  Radha Jagadeesan,et al.  Default timed concurrent constraint programming , 1995, POPL '95.

[14]  Patrick Cousot,et al.  Automatic synthesis of optimal invariant assertions: Mathematical foundations , 1977, Artificial Intelligence and Programming Languages.

[15]  Philippe Codognet,et al.  A Metalevel Compiler of CLP(FD) and Its Combination with Intelligent Backtracking , 1993, WCLP.

[16]  Patrice Boizumault,et al.  Implementing Constraint Relaxation over Finite Domains using ATMS , 1996 .

[17]  Christian Bessiere,et al.  Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.

[18]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[19]  Krzysztof R. Apt,et al.  From Chaotic Iteration to Constraint Propagation , 1997, ICALP.

[20]  Philippe Codognet,et al.  Extending the WAM for Intelligent Backtracking , 1991, ICLP.

[21]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[22]  Henri Beringer,et al.  Intelligent Backtracking for CLP Languages: An Application to CLP(R) , 1991, ISLP.

[23]  Frank S. de Boer,et al.  Non-monotonic Concurrent Constraint Programming , 1993, ILPS.

[24]  Michael J. Maher,et al.  Expanding Query Power in Constraint Logic Programming Languages , 1989, NACLP.

[25]  Francesca Rossi,et al.  Constraint Reaction in FD , 1996, FSTTCS.

[26]  Jean Jourdan,et al.  The Versatility of Handling Disjunctions as Constraints , 1993, PLILP.

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

[28]  François Fages,et al.  A Reactive Constraint Logic Programming Scheme , 1995, ICLP.