Some remarks on boolean constraint propagation

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

Volumn 1865, Issue , 2000, Pages 91-107

  Apt, Krzysztof R ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARC CONSISTENCY; BOOLEAN CONSTRAINT; PROPAGATION RULE; PROPOSITIONAL LOGIC; SET OF RULES; UNIT PROPAGATION;

BOOLEAN FUNCTIONS;

EID: 84858492195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44654-0_5     Document Type: Conference Paper

References (15)

1. A. Aggoun et al. (1995), ECLiPSe 3.5 User Manual, Munich, Germany.
2. Apt, K. R. (1998), ‘A proof theoretic view of constraint programming’, Fundamenta Informaticae 33(3), 263–293. Available via http://xxx.lanl.gov/archive/cs/.
3. Apt, K. R. & Monfroy, E. (1999), Automatic generation of constraint propagation algorithms for small finite domains, in J. Jaffar, ed., ‘Fifth International Conference on Principles and Practice of Constraint Programming (CP’99)’, Lecture Notes in Computer Science, Springer-Verlag, Alexandra, Virginia, USA. Available via http://xxx.lanl.gov/archive/cs/.
4. Codognet, P. & Diaz, D. (1996), ‘A simple and efficient Boolean constraint solver for constraint logic programming’, Journal of Automated Reasoning 17(1), 97–128.
5. Davis, M. & Putnam, H. (1960), ‘A computing procedure for quantification theory’, Journal of the ACM 7(3), 201–215.
6. Frühwirth, T. (1995), Constraint Handling Rules, in A. Podelski, ed., ‘Constraint Programming: Basics and Trends’, LNCS 910, Springer-Verlag, pp. 90–107. (Chˆatillon-sur-Seine Spring School, France, May 1994).
7. Frühwirth, T. (1998), ‘Theory and practice of constraint handling rules’, Journal of Logic Programming 37(1–3), 95–138. Special Issue on Constraint Logic Programming (P. Stuckey and K. Marriot, Eds.).
8. Frühwirth, T. Herold, A. Küchenhoff, V. Provost, T. L, Lim, P. Monfroy, E. & Wallace, M. (1992), Constraint logic programming: An informal introduction, in G. Comyn, N. E. Fuchs &M. J. Ratcliffe, eds, ‘Logic Programming in Action’, LNCS 636, Springer-Verlag, pp. 3–35.
9. Mackworth, A. (1977), ‘Consistency in networks of relations’, Artificial Intelligence 8(1), 99–118.
10. Marriott, K. & Stuckey, P. (1998), Programming with Constraints, The MIT Press, Cambridge, Massachusetts.
11. McAllester, D. (1980), ‘An outlook on truth maintenance’ MIT, Artificial Intelligence Laboratory, AI Memo No. 551.
12. McAllester, D. (1990), Truth maintenance, in ‘AAAI-90: Proceedings 8th National Conference on Artificial Intelligence’, pp. 1109–1116.
13. Mohr, R. & Masini, G. (1988), Good old discrete relaxation, inY. Kodratoff, ed., ‘Proceedings of the 8th European Conference on Artificial Intelligence (ECAI)’, Pitman Publishers, pp. 651– 656.
14. Simonis, H. (1989), Test generation using the Constraint Logic Programming language CHIP, in G. Levi & M. Martelli, eds, ‘ICLP’89: Proceedings 6th International Conference on Logic Programming’, MIT Press, Lisbon, Portugal, pp. 101–112.
15. Zhang, H. & Stickel, M. (1996), An efficient algorithm for unit propagation, in ‘Proc. of the Fourth International Symposium on Artificial Intelligence and Mathematics’, Ft. Lauderdale, Florida.