The effect of constraint representation on structural tractability

Authors:
Chris Houghton;David Cohen;Martin J. Green
Affiliations:
Department of Computer Science, Royal Holloway, University of London, UK;Department of Computer Science, Royal Holloway, University of London, UK;Department of Computer Science, Royal Holloway, University of London, UK
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 2
Cited 3

On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
A comparison of structural CSP decomposition methods

Artificial Intelligence

Structural Tractability of Propagated Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Constraint representations and structural tractability

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Modularity-based decompositions for valued CSP

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tractability results for structural subproblems have generally been considered for explicit relations listing the allowed assignments. In this paper we define a representation which allows us to express constraint relations as either an explicit set of allowed labelings, or an explicit set of disallowed labelings, whichever is smaller. We demonstrate a new structural width parameter, which we call the interaction width, that when bounded allows us to carry over well known structural decompositions to this more concise representation. Our results naturally derive new structurally tractable classes for SAT.