Experiments in reactive constraint logic programming

✍ Scribed by Francois Fages; Julian Fowler; Thierry Sola

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 872 KB
• Volume: 37
• Category: Article
• ISSN: 0743-1066
• DOI: 10.1016/s0743-1066(98)10008-0

✦ Synopsis

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 eciently. 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 de®ne 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.