摘要: Publisher Summary This chapter discusses that constraint reasoning involves various types of techniques to tackle the inherent intractability problem satisfying a set constraints. Constraint propagation is one those techniques. It central process solving and indispensable for reasoning. The examines embeds any reasoning, which consists in explicitly forbidding values or combinations some variables problem, because given subset its constraints cannot be satisfied otherwise. this concept shows most accomplished form. There no other field appears such variety forms, characteristics have been analyzed. reviews it formalizes all approaches within unifying framework main existing propagation.
sci-hub.se 参考文章(55)
Hervé Cros, Compilation et apprentissage dans les réseaux de contraintes Montpellier 2. ,(2003)
Constraint Programming: Basics and Trends Untitled Event. ,(1995) , 10.1007/3-540-59155-9
Jon William Freeman, Improvements to propositional satisfiability search algorithms University of Pennsylvania. ,(1995)
David L. Waltz, Generating Semantic Descriptions From Drawings of Scenes With Shadows Generating Semantic Descriptions From Drawings of Scenes With Shadows. ,(1972)
Marco Cadoli, Francesco M. Donini, A survey on knowledge compilation Ai Communications. ,vol. 10, pp. 137- 150 ,(1997)
Chi Kan Cheng, Jimmy Ho Man Lee, Peter J. Stuckey, Box constraint collections for adhoc constraints principles and practice of constraint programming. pp. 214- 228 ,(2003) , 10.1007/978-3-540-45193-8_15
Search in Artificial Intelligence Search in Artificial Intelligence 1st. pp. 492- 492 ,(1988) , 10.1007/978-1-4613-8788-6
Thi Bich Hanh Dao, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin, Indexical-Based Solver Learning principles and practice of constraint programming. pp. 541- 555 ,(2002) , 10.1007/3-540-46135-3_36
Krzysztof Apt, Principles of constraint programming ,(2003)