论文信息 - A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure

A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure

In this report we introduce a new hybrid class for which arc-consistency is a decision procedure. This new hybrid class includes infinitely many instances whose tractability is not assured by any tractable language or structural restriction, and strongly motivates the search for a unifying principle for the tractable constraint classes decided by arc-consistency.

David A. Cohen | D. Cohen

[1] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[2] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[3] John N. Hooker,et al. Extended Horn sets in propositional logic , 1991, JACM.

[4] David A. Cohen,et al. Tractability by Approximating Constraint Languages , 2003, CP.

[5] Joxan Jaffar,et al. Principles and Practice of Constraint Programming – CP’99 , 1999, Lecture Notes in Computer Science.

[6] Marc Gyssens,et al. Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[7] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.

[8] Justin Pearson,et al. Closure Functions and Width 1 Problems , 1999, CP.

[9] D. Rose. Triangulated graphs and the elimination process , 1970 .