Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
A comparison of structural CSP decomposition methods
Artificial Intelligence
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint Processing
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Hypertree width and related hypergraph invariants
European Journal of Combinatorics
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Undirected connectivity in log-space
Journal of the ACM (JACM)
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal solution is an NP-hard problem in general; yet, when restricted over classes of instances whose constraint interactions can be modelled via (nearly-)acyclic graphs, this problem is known to be solvable in polynomial time. In this paper, larger classes of tractable instances are singled out, by discussing solution approaches based on exploiting hypergraph acyclicity and, more generally, structural decomposition methods, such as (hyper)tree decompositions.