Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
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 revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
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
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Journal of Combinatorial Theory Series B
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Tree-Related Widths of Graphs and Hypergraphs
SIAM Journal on Discrete Mathematics
Tree-width and functional dependencies in databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Marshals, monotone marshals, and hypertree-width
Journal of Graph Theory
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Parameterized Complexity
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We introduce tree-width for first order formulae φ, fotw(φ). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed parameter tractable, with parameter the length of the formula. This is done by translating a formula φ with fotw(φ) k into a formula of the k-variable fragment Lk of first order logic. For fixed k, the question whether a given first order formula is equivalent to an Lk formula is undecidable. In contrast, the classes of first order formulae with bounded fotw are fragments of first order logic for which the equivalence is decidable. Our notion of tree-width generalises tree-width of conjunctive queries to arbitrary formulae of first order logic by taking into account the quantifier interaction in a formula. Moreover, it is more powerful than the notion of elimination-width of quantified constraint formulae, defined by Chen and Dalmau (CSL 2005): For quantified constraint formulae, both bounded elimination-width and bounded fotw allow for model checking in polynomial time. We prove that fotw of a quantified constraint formula φ is bounded by the elimination-width of φ, and we exhibit a class of quantified constraint formulae with bounded fotw, that has unbounded elimination-width. A similar comparison holds for strict tree-width of non-recursive stratified datalog as defined by Flum, Frick, and Grohe (JACM 49, 2002). finally, we show that fotw has a characterization in terms of a robber and cops game without monotonicity cost.