Tree automata and logic programs
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Information Processing Letters
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Logic programming and databases
Logic programming and databases
Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
The Ha¨rtig quantifier: a survey
Journal of Symbolic Logic
The design of relational databases
The design of relational databases
The complexity of logic-based abduction
Journal of the ACM (JACM)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Languages, automata, and logic
Handbook of formal languages, vol. 3
All structured programs have small tree width and good register allocation
Information and Computation
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
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
Query automata over finite trees
Theoretical Computer Science
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The Treewidth of Java Programs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Generalized Quantifiers in Logic Programs
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Safe Reduction Rules for Weighted Treewidth
Algorithmica
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Answer Set Programming with Constraints Using Lazy Grounding
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Parameterized Complexity
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
Hi-index | 0.00 |
Bounded treewidth and monadic second-order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we know that any property of finite structures, which is expressible by an MSO sentence, can be decided in linear time (data complexity) if the structures have bounded treewidth. In principle, Courcelle's Theorem can be applied directly to construct concrete algorithms by transforming the MSO evaluation problem into a tree language recognition problem. The latter can then be solved via a finite tree automaton (FTA). However, this approach has turned out to be problematical, since even relatively simple MSO formulae may lead to a “state explosion” of the FTA. In this work we propose monadic datalog (i.e., datalog where all intentional predicate symbols are unary) as an alternative method to tackle this class of fixed-parameter tractable problems. We show that if some property of finite structures is expressible in MSO then this property can also be expressed by means of a monadic datalog program over the decomposed structure: we mean by this that the original structure is augmented with new elements and new relations that encode one of its tree decompositions. In the first place, we thus compare the expressive power of two query languages. However, we also show that the resulting fragment of datalog can be evaluated in linear time (both with respect to the program size and with respect to the data size). Hence, our transformation of an MSO query into a monadic datalog program yields an alternative proof of Courcelle's Theorem. In order to actually construct efficient algorithms for problems whose tractability is due to Courcelle's Theorem, we propose to use a fragment of full (i.e., not necessarily monadic) datalog which allows for a succinct representation of the corresponding monadic datalog programs and for an efficient execution. This new approach is put to work by devising datalog programs for the 3-Colorability problem of graphs and for the PRIMALITY problem of relational schemas (i.e., testing if some attribute in a relational schema is part of a key). We also report on experimental results with a prototype implementation.