Improving domain filtering using restricted path consistency

Proceedings the 11th Conference on Artificial Intelligence for Applications, CAIA 1995

Volumn , Issue , 1995, Pages 32-37

  Berlandier, P ^a  

^a UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ARC CONSISTENCY; CONSTRAINT GRAPH; DOMAIN FILTERING; PATH CONSISTENCY; PATH-BASED;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947971231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAIA.1995.378792     Document Type: Conference Paper

References (8)

1. C. Han, C. Lee. Comments on Mohr and Henderson’s path consistency algorithm. Artificial Intelligence, 36:125-130, 1988.
2. A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
3. R. Mohr, T. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225-233, 1986.
4. R. Mohr, G. Masini. Good old discrete relaxation. In Proc. ECAI, Munich, Germany, 1988.
5. U. Montanari. Networks of constraints: Fundamental properties and application to picture processing. Information Science, 7(3):95-132, 1974.
6. D.Sabin, E. Fkeuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI, Amsterdam, Netherlands, 1994.
7. E. Tsang. Foundations of ConstraintSat-isfaction. Academic Press, 1993.
8. R. Wallace. Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs. In Proc. IJCAI, Chambhry, France, 1993.