Logic programming approaches for representing and solving constraint satisfaction problems: A comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1955, Issue , 2000, Pages 225-239

  Pelov, Nikolay ^a   De Mot, Emmanuel ^a   Denecker, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; QUERY PROCESSING; SEMANTICS;

COMBINATORIAL SEARCH; CONSTRAINT LOGIC PROGRAMMING; FIRST ORDER LOGIC; STABLE MODEL SEMANTICS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84956869120     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44404-1_15     Document Type: Conference Paper

References (24)

1. [1] M. Denecker. Extending classical logic with inductive definitions. In J. Lloyd et al., editors, First International Conference on Computational Logic, volume 1861 of Lecture Notes in Artificial Intelligence, pages 703–717, London, U.K., July 2000. Springer.
2. [2] M. Denecker and D. De Schreye. SLDNFA: an abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2):201–226, Feb. 1998.
3. [3] M. Denecker and B. Van Nuffelen. Experiments for integration CLP and abduction. In K. Apt, A. Kakas, E. Monfroy, and F. Rossi, editors, Proceedings of the 1999 ERCIM/COMPULOG Workshop on Constraints, Paphos, Cyprus, Oct. 1999. University of Cyprus.
4. [4] M. Denecker, H. Vandecasteele, D. De Schreye, G. Seghers, and T. Bayens. Scheduling by “abductive execution” of a classical logic specification. In ERCIM/COMPULOG Workshop on Constraints, Schloss Hagenberg, Austria, Oct.27–28 1997.
5. [5] K. Eshghi and R. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proceedings of the Sixth International Conference on Logic Programming, pages 234–254. Lisbon, Portugal, MIT Press, June 1989.
6. [6] M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Logic Programming, Proceedings of the Fifth International Conference and Symposium, pages 1070–1080, Seattle, Washington, Aug. 1988. MIT Press.
7. [7] J. Jaffar and M. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20:503–581, 1994.
8. [8] A. C. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719–770, Dec. 1992.
9. [9] A. C. Kakas and A. Michael. Integrating abductive and constraint logic programming. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 399–413. Tokyo, Japan, MIT Press, 1995.
10. [10] A. C. Kakas, A. Michael, and C. Mourlas. ACLP: Abductive constraint logic programming. Journal of Logic Programming, 44(1–3):129–177, 2000.
11. [11] V. Lifschitz. Answer set planning. In D. De Schreye, editor, Proceedings of the 16th International Conference on Logic Programming, pages 23–37. MIT Press, Dec. 1999.
12. [12] A. K. Mackworth. The logic of constraint satisfaction. Journal of Artificial Intelligence, 58(1–3):3–20, Dec. 1992.
13. [13] V. W. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In K. R. Apt, V. W. Marek, M. Truszczyński, and D. S. Warren, editors, The Logic Programming Paradigm: A 25-Year Perespective, pages 375–398. Springer, 1999.
14. [14] I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999.
15. [15] I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Logic Programming, Proceedings of the 1996 Joint International Conference and Syposium, pages 289–303, Bonn, Germany, Sept. 1996. MIT Press.
16. [16] I. Niemelä, P. Simons, and T. Soininen. Stable model semantics of weight constraint rules. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning, volume 1730 of Lecture Nortes in Computer Science, pages 317–331, El Paso, Texas, USA, Dec. 1999. Springer-Verlag.
17. [17] N. Pelov, E. De Mot, and M. Bruynooghe. A comparison of logic programming approaches for representation and solving of constraint satisfaction problems. In M. Denecker, A. Kakas, and F. Toni, editors, 8th International Workshop on Non-Monotonic Reasoning, Special Session on Abduction, Breckenridge, Colorado, USA, Apr. 2000.
18. [18] G. Seghers and T. Bayens. Solving a combinatorial maintenance problem for electrical power plants, developed in OLP-FOL and CLP. Master’s thesis, Department of Computer Science, K.U.Leuven, 1996.
19. [19] E. Tsang. Foundations of Constraint Satisfaction. Computation in Cognitive Science. Academic Press, 1993.
20. [20] P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
21. B. Van Nuffelen and M. Denecker. Problem solving in ID-logic with aggregates. In A. K. Mark Denecker, editor, Eight International Workshop on Nonmonotonic Reasoning, special track on Abductive Reasoning, Breckenridge, Colorado, USA, 2000. Workshop associated with KR’2000.
22. [22] H. Vandecasteele. Constraint Logic Programming: Applications and Implementation. PhD thesis, K.U.Leuven, 1999.
23. [23] H. Vandecasteele and D. De Schreye. Implementing a finite-domain CLP-language on top of Prolog: a transformational approach. In F. Pfenning, editor, Proceedings of Logic Programming and Automated Reasoning, volume 822 of Lecture Notes in Artificial Intelligence, pages 84–98, Kiev, Ukraine, 1994. Springer-Verlag.
24. [24] J. Zhang and H. Zhang. Constraint propagation in model generation. In U. Montanari and F. Rossi, editors, Proc. of 1st International Conference on Principles and Practice of Constraint Programming, volume 976 of Lecture Notes in Computer Science, pages 398–414, France, Sept. 1995. Springer.