A comparison of structural CSP decomposition methods
Top Cited Papers
- 28 November 2000
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 124 (2), 243-282
- https://doi.org/10.1016/s0004-3702(00)00078-3
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Hypertree Decompositions and Tractable QueriesJournal of Computer and System Sciences, 2002
- Closure properties of constraintsJournal of the ACM, 1997
- Treewidth: Algorithmic techniques and resultsPublished by Springer Nature ,1997
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- Syntactic Characterization of Tree Database SchemasJournal of the ACM, 1983
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983