Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Easy problems for tree-decomposable graphs
Journal of Algorithms
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Model theory and computer science: an appetizer
Handbook of logic in computer science (vol. 1)
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
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
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Parameterized Complexity
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
Logic-based web information extraction
ACM SIGMOD Record
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
On the complexity of division and set joins in the relational algebra
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Semijoin Algebra and the Guarded Fragment
Journal of Logic, Language and Information
Query answering exploiting structural properties
ACM SIGMOD Record
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Conjunctive queries over trees
Journal of the ACM (JACM)
On the expressive power of monadic least fixed point logic
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient evaluation of n-ary conjunctive queries over trees and graphs
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Efficient core computation in data exchange
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Compact Representation for Answer Sets of n-ary Regular Queries
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
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
A Practical Approach to Courcelle's Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Graph Theory, Computational Intelligence and Thought
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Grounding for model expansion in k-guarded formulas with inductive definitions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Propagating logical combinations of constraints
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
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
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Compact representation for answer sets of n-ary regular queries
Theoretical Computer Science
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Database theory: query languages
Algorithms and theory of computation handbook
The impact of virtual views on containment
Proceedings of the VLDB Endowment
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Grammar factorization by tree decomposition
Computational Linguistics
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Preservation under extensions on well-behaved finite structures
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
First-Order queries over one unary function
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Worst-case optimal join algorithms: [extended abstract]
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
First-Order and Monadic Second-Order Model-Checking on Ordered Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Efficient symbolic implementation of graph automata with applications to invariant checking
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Parameterized top-K algorithms
Theoretical Computer Science
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
Enumeration of monadic second-order queries on trees
ACM Transactions on Computational Logic (TOCL)
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.01 |
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or queries. We systematically study these methods.In the first part of the article, we consider arbitrary formulas on tree-like structures. We generalize a theorem of Courcelle [1990] by showing that on structures of bounded tree-width a monadic second-order formula (with free first- and second-order variables) can be evaluated in time linear in the structure size plus the size of the output.In the second part, we study tree-like formulas on arbitrary structures. We generalize the notions of acyclicity and bounded tree-width from conjunctive queries to arbitrary first-order formulas in a straightforward way and analyze the complexity of evaluating formulas of these fragments. Moreover, we show that the acyclic and bounded tree-width fragments have the same expressive power as the well-known guarded fragment and the finite-variable fragments of first-order logic, respectively.