Relational queries computable in polynomial time
Information and Control
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Tree clustering for constraint networks (research note)
Artificial Intelligence
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics
From local to global consistency
Artificial Intelligence
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of tree homomorphisms
Discrete Applied Mathematics
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraint satisfaction methods for generating valid cuts
Advances in computational and stochastic optimization, logic programming, and heuristic search
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Game-Theoretic Approach to Constraint Satisfaction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parameterized Complexity
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Conjunctive query evaluation by search-tree revisited
Theoretical Computer Science
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Tree-width and functional dependencies in databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Pure Nash equilibria: complete characterization of hard and easy graphical games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the equivalence of distributed systems with queries and communication
Proceedings of the 14th International Conference on Database Theory
Hybrid tractability of valued constraint problems
Artificial Intelligence
Clause-learning algorithms with many restarts and bounded-width resolution
Journal of Artificial Intelligence Research
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On the threshold of having a linear treewidth in random graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Conjunctive query evaluation by search tree revisited
ICDT'05 Proceedings of the 10th international conference on Database Theory
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Exact algorithms for graph homomorphisms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Lower Bounds for Existential Pebble Games and k-Consistency Tests
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences
A characterisation of the complexity of forbidding subproblems in binary Max-CSP
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
On the equivalence of distributed systems with queries and communication
Journal of Computer and System Sciences
Towards a similarity-based web service discovery through soft constraint satisfaction problems
Proceedings of the 2nd International Workshop on Semantic Search over the Web
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We systematically investigate the connections between constraint satisfaction problems, structures of bounded treewidth, and definability in logics with a finite number of variables. We first show that constraint satisfaction problems on inputs of treewidth less than k are definable using Datalog programs with at most k variables; this provides a new explanation for the tractability of these classes of problems. After this, we investigate constraint satisfaction on inputs that are homomorphically equivalent to structures of bounded treewidth. We show that these problems are solvable in polynomial time by establishing that they are actually definable in Datalog; moreover, we obtain a logical characterization of the property "being homomorphically equivalent to a structure of bounded treewidth" in terms of definability in finite-variable logics. Unfortunately, this expansion of the tractability landscape comes at a price, because we also show that, for each k 驴 2, determining whether a structure is homomorphically equivalent to a structure of treewidth less than k is an NP-complete problem. In contrast, it is well known that, for each k 驴 2, there is a polynomial-time algorithm for testing whether a given structure is of treewidth less than k. Finally, we obtain a logical characterization of the property "having bounded treewidth" that sheds light on the complexity-theoretic difference between this property andt he property 'being homomorphically equivalent to a structure of bounded treewidth".