Tractable constraints on ordered domains

Artificial Intelligence

Volumn 79, Issue 2, 1995, Pages 327-339

  Jeavons, Peter G ^a   Cooper, Martin C ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORMAL LOGIC; GRAPH THEORY; POLYNOMIALS;

COMBINATORIAL PROBLEMS; CONSTRAINT SATISFACTION PROBLEM; HORN FORMULA; POLYNOMIAL TIME ALGORITHM; PROPOSITIONAL LOGIC;

PROBLEM SOLVING;

EID: 0029484941     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00107-7     Document Type: Article

References (21)

1. Characterizing tractable constraints
2. From local to global consistency
3. Constraint networks
4. Network-based heuristics for constraint-satisfation problems
5. Structure identification in relational data
6. A sufficient condition for backtrack-bounded search
7. Decomposing constraint satisfaction problems using database techniques
8. A filtering process for general constraint satisfaction problems achieving pair-wise consistency using an associated binary representation
9. A substitution operation for constraints
10. Fast parallel constraint satisfaction
11. Consistency in networks of relations
12. Networks of constraints: fundamental properties and applications to picture processing
13. Constraint relaxation may be perfect
14. The complexity of satisfiability problems
15. On the minimality and decomposability of row-convex constraint networks
16. Constraint tightness versus global consistency
17. A generic arc-consistency algorithm and its specializations