Experiments in reactive constraint logic programming

Journal of Logic Programming

Volumn 37, Issue 1-3, 1998, Pages 185-212

  Fages, Francois ^a   Fowler, Julian ^b   Sola, Thierry ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b FCA UNESP   (Brazil)

^c THALES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; QUERY LANGUAGES;

CONSTRAINT PROPAGATION; QUERY MANIPULATION COMMAND;

LOGIC PROGRAMMING;

EID: 0032188383     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10008-0     Document Type: Article

References (31)

1. K.R. Apt, From chaotic iteration to constraint propagation, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP '97) (invited lecture) Springer, Berlin, 1997, pp. 36-55.
2. C. Bessière (Ed.), Arc-consistency in dynamic constraint satisfaction problems, AAAI, Anaheim, USA, 1991, pp. 221-226.
3. P. Chatalic, Incremental techniques and Prolog, Technical Report TR-LP-23, ECRC, ECRC GmbH, Arabellastr, 17, D-8000 Muenchen 81, Germany, 1987.
4. P. Codognet, D. Diaz, F. Rossi, Constraint retraction in FD, 16th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1116, Springer, Berlin, 1996.
5. P. Codognet, F. Fages, T. Sola, A metalevel compiler of clp(FD) and its combination with intelligent backtracking, in: F. Benhamou, A. Colmerauer (Eds.), Constraint Logic Programming Selected Research, MIT Press, Cambridge, MA, 1993, pp. 437-456.
6. P. Codognet, F. Rossi, Nmcc programming: constraint enforcement and retraction in cc programming, Proceedings of ICLP'95, MIT Press, Cambridge, MA, 1995.
7. P. Codognet, T. Sola, Extending the wam for intelligent backtracking, in: K. Furukawa (Ed.), Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 127-141.
8. P. Cousot, R. Cousot, Automatic synthesis of optimal invariant assertions: mathematical foundations, ACM Symposium on Artificial Intelligence and Programming Languages, SIGPLAN Notices, vol. 12, no. 8, 1977, pp. 1-12.
9. B. De Backer, H. Beringer, Intelligent backtracking for clp languages: an application to clp(r), Proceedings of ILPS'91, MIT Press, Cambridge, MA, 1991.
10. F.S. De Boer, J.N. Kok, C. Palamidessi, J.J. Rutten, Non-monotonic concurrent constraint programming. Proceedings of ILPS'93, MIT Press, Cambridge, MA, 1993.
11. R. Dechter, A. Dechter, Belief maintenance in dynamic constraint networks, Proceedings of AAAI, 1988, pp. 37-42.
12. J. Doyle, A truth maintenance system, Artificial Intelligence 12 (1979) 231-273.
13. F. Fages, J. Fowler, T. Sola, Handling preferences in constraint logic programming with relational optimization. Proceedings of PLILP94, Madrid, Spain, 1994.
14. F. Fages, J. Fowler, T. Sola, A reactive constraint logic programming scheme, Proceedings of ICLP'95, MIT Press, Cambridge, MA, 1995.
15. D. Harel, A. Pnueli, On the development of reactive systems. In NATO Advance Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, NATO Series F, vol. 13, Springer, Berlin, 1985, pp. 477-498.
16. J. Jaffar, J.L. Lassez, Constraint logic programming, proceedings of POPL'87, ACM, Munich, 1987, pp. 111-119.
17. J. Jaffar, M.J. Maher, Constraint logic programming: a survey, Journal of Logic Programming 19/20 (1994) 503-581.
18. J. Jourdan, T. Sola, The versatility of handling disjunctions as constraints, in: M. Bruynooghe, J. Penjam (Eds.), Fifth International Symposium, PLILP'93, Lecture Notes on Computer Science, vol. 714, Springer, Berlin, 1993, pp. 60-74.
19. N. Jussien, P. Boizumault, Implementing constraint relaxation over finite domains using atms, in: E. Freuder M. Jampel, M. Maher (Eds.), Over-Constrained Systems, Lecture Notes on Computer Science, vol. 1106, Springer, Berlin, 1996, pp. 265-280.
20. J.L. Lassez, Parametric queries, linear constraints and variable elimination, Proceedings of DICS'90, Capri, 1990.
21. R. Lissajoux, Meta(F) 3.58 users' manual, Thomson-CSF, LCR, Orsay, 3.58th ed., 1994.
22. M.J. Maher, P.J. Stuckey, Expanding Query Power in Constraint Logic Programming Languages, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming, Cleveland, Ohio, USA, 1989, pp. 20-36.
23. M.J. Maher, A logical semantics for a class of comitted choice languages, in: J.L. Lassez (Ed.), Proceedings of ICLP 87, MIT Press, Cambridge, MA, 1987, pp. 858-876.
24. F. Menezes, P. Barahona, Defeasible constraint solving, in: E. Freuder M. Jampel, M. Maher (Eds.), Over-Constrained Systems, Lecture Notes on Computer Science, vol. 1106, Springer, Berlin, 1996, pp. 151-170.
25. V.A. Saraswat, R. Jagadeesan, V. Gupta, Default timed concurrent constraint programming, Proceedings POPL'95, 1995.
26. V.A. Saraswat, M. Rinard, P. Pranangaden, Semantic foundations of concurrent constraint programming, Proceedings 18th ACM Symposium on Principles of Programming Languages, 1991.
27. SICStus Prolog 3.5 User's Manual, Swedish Institute in Computer Science, 3.5th ed., 1996.
28. P. van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, Cambridge, MA, 1989.
29. P. Van Hentenryck, Incremental constraint satisfaction in logic programming, in: D.H.D. Warren, P. Szeredi (Eds.), Proceedings of the Seventh International Conference on Logic Programming, The MIT Press, Cambridge, MA, 1990, pp. 189-202.
30. P. van Hentenryck, V. Saraswat, Y. Deville, Design, Implementations, and Evaluation of the Constraint Language cc(FD), Technical Report CS-93-02, Brown University, 1993.
31. G. Verfaillie, T. Schiex, Solution reuse in dynamic CSPS, Proceedings of AAAI, Seattle, WA, 1994.