Binary vs. non-binary constraints

Artificial Intelligence

Volumn 140, Issue 1-2, 2002, Pages 1-37

  Bacchus, Fahiem ^a   Chen, Xinguang ^b   Van Beek, Peter ^c   Walsh, Toby ^d  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Constraint satisfaction; Dual encoding; Hidden variable encoding; Non binary constraints

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS;

NON-BINARY CONSTRAINTS;

CONSTRAINT THEORY;

EID: 0036724562     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00210-2     Document Type: Article

References (26)

1. On the conversion between non-binary and binary constraint satisfaction problems
2. Arc consistency for general constraint networks: Preliminary results
3. Domain filtering consistencies
4. On the expressiveness of networks with hidden variables
5. Tree clustering for constraint networks
6. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems
7. Effective redundant constraints for online scheduling
8. Increasing tree search efficiency for constraint satisfaction problems
9. Decomposition of domains based on the micro-structure of finite constraint satisfaction problems
10. A theoretical evaluation of selected backtracking algorithms
11. Consistency in networks of relations
12. On reading sketch maps
13. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
14. Constraint satisfaction algorithms
15. Representation selection for constraint satisfaction: A case study using n-queens
16. On the equivalence of constraint satisfaction problems
17. Contradicting conventional wisdom in constraint satisfaction
18. Standard models for finite domain constraint solving
19. The progressive party problem: Integer linear programming and constraint programming compared
20. Encodings of non-binary constraint satisfaction problems
21. CPlan: A constraint programming approach to planning
22. On reformulation of constraint satisfaction problems