Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains-Reference-Cited by-同舟云学术

Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains

Published:1999 Issue: Volume: Page:58-72
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP’99
language:
Short-container-title:

Author:

Apt Krzysztof R.,Monfroy Eric

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-48085-3_5

Reference12 articles.

1. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of ACM 26(11), 832–843 (1983)

2. Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science 221(1-2), 179–210 (1999), Available via http://xxx.lanl.gov/archive/cs/

3. Dalal, M.: Efficient Propositional Constraint Propagation. In: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI 1992, San Jose, California, pp. 409–414 (1992)

4. Dechter, R., van Beek, P.: Local and global relational consistency. Theoretical Computer Science 173(1), 283–308 (1997)

5. Fr??hwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming??37(1???3), 95???138 (1998);

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized support and formal development of constraint propagators;AI Communications;2017-08-31

2. Generation of Rule-Based Constraint Solvers: Combined Approach;Logic-Based Program Synthesis and Transformation;2008

3. Two Contributions of Constraint Programming to Machine Learning;Machine Learning: ECML 2005;2005

4. The Refined Operational Semantics of Constraint Handling Rules;Logic Programming;2004

5. Learning Approximate Consistencies;Lecture Notes in Computer Science;2004