A new class of binary CSPs for which arc-consistency is a decision procedure

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

Volumn 2833, Issue , 2003, Pages 807-811

  Cohen, David A ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ARC CONSISTENCY; CONSTRAINT CLASS; DECISION PROCEDURE; STRUCTURAL RESTRICTIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248820534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_57     Document Type: Article

References (8)

1. C. Bessiére. Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1):179-190, 1994.
2. V. Chandru and J.N. Hooker. Extended Horn sets in propositional logic. Journal of the ACM, 38:205-221, 1991.
3. V. Dalmau and J. Pearson. Closure functions and width 1 problems. In J. Jaffar, editor, Principles and Practice of Constraint Programming-CP'99, volume 1713 of Lecture Notes in Computer Science, pages 159-173. Springer-Verlag, 1999.
4. M.J. Green and D.A. Cohen. Tractability by approximating constraint languages. Technical Report CSD-TR-03-01, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK, 2003.
5. M. Gyssens, P.G. Jeavons, and D.A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1):57-89, 1994.
6. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
7. D.J. Rose. Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications, 32:597-609, 1970.
8. Robert E. Tarjan and Mihalis Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566-579, 1984.