Definability and Descriptive Complexity on Databases of Bounded Tree-Width (original) (raw)
Related papers
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
Lecture Notes in Computer Science, 2002
The complexity of relational query languages
Proceedings of the fourteenth annual ACM symposium …, 1982
First-order definable counting-only queries
Annals of Mathematics and Artificial Intelligence, 2019
Discrete Applied Mathematics, 2001
On the first-order expressibility of recursive queries
Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '89
Computing queries with higher-order logics
Theoretical Computer Science, 2006
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2007
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic, 2010
Expressiveness and complexity of graph logic
Information and Computation, 2007
A Normal Form for First-Order Logic Over Doubly-Linked Data Structures
International Journal of Foundations of Computer Science, 2008
The Kolmogorov Expressive Power of Boolean Query Languages
Theoretical Computer Science, 1998
On the xed parameter complexity of graph enumeration problems de nable in monadic second-order logic
2000
Expressive power of monadic logics on words, trees, pictures, and graphs
2008
Tractable database design and datalog abduction through bounded treewidth
Information Systems, 2010
Data Complexity of Query answering in Description Logics
… . of the 10th Int. Conf. on …, 2006
Local Properties of Query Languages
Database TheoryICDT'97, 1997
On the implementation of a simple class of logic queries for databases
Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '86, 1986
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
Journal of Computer and System Sciences, 1997
Complexity of higher-order queries
ICDT: The 14th International Conference on Database …, 2011
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence, 2010
Closed Predicates in Description Logics: Results on Combined Complexity
2016
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory - ICDT '12, 2012
Decidable containment of recursive queries
Theoretical Computer Science, 2005
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
Fundamenta Informaticae, 2010
Approximating the Expressive Power of Logics in Finite Models
Lecture Notes in Computer Science, 2004
On the expressive power of monadic least fixed point logic
Theoretical Computer Science, 2006
On problems of databases over a fixed infinite universe
Banach Center Publications, 1999