Complexity of K-tree structured constraint satisfaction problems

Authors:
Eugene C. Freuder
Affiliations:
Department of Computer Science, University of New Hampshire, Durham, New Hampshire
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 6
Cited 18

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey

BIT - Ellis Horwood series in artificial intelligence
Characterization and recognition of partial 3-trees

SIAM Journal on Algebraic and Discrete Methods
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)

Extracting constraint satisfaction subproblems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
On the equivalence of distributed systems with queries and communication

Proceedings of the 14th International Conference on Database Theory
Treewidth in verification: local vs. global

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Search vs. symbolic techniques in satisfiability solving

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Sequences characterizing k-trees

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
The structure of tractable constraint satisfaction problems

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
From pebble games to tractability: an ambidextrous consistency algorithm for quantified constraint satisfaction

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Patterns with bounded treewidth

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Finding a Periodic Attractor of a Boolean Network

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Decomposing Quantified Conjunctive (or Disjunctive) Formulas

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the power of k-consistency

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of approximating bounded-degree Boolean #CSP

Information and Computation
Structural tractability of enumerating CSP solutions

Constraints
The tractability of CSP classes defined by forbidden patterns

Journal of Artificial Intelligence Research
On the equivalence of distributed systems with queries and communication

Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Journal of the ACM (JACM)
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trees have played a key role in the study of constraint satisfaction problems because problems with tree structure can be solved efficiently. It is shown here that a family of generalized trees, k-trees, can offer increasing representational complexity for constraint satisfaction problems, while maintaining a bound on computational complexity linear in the number of variables and exponential in k. Additional results are obtained for larger classes of graphs known as partial k-trees. These methods may be helpful even when the original problem does not have k-tree or partial k-tree structure. Specific tradeoffs are suggested between representational power and computational complexity.