On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Relational queries computable in polynomial time
Information and Control
Data independent recursion in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The parallel complexity of simple chain queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds on the propagation of selection into logic programs
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Alternating automata on infinite trees
Theoretical Computer Science
Computing with logic: logic programming with Prolog
Computing with logic: logic programming with Prolog
Logic programming and parallel complexity
Foundations of deductive databases and logic programming
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
On computing restricted projections of representative instances
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logic and Data Bases
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Invited talk: automata theory for database theoreticians
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety of datalog queries over infinite databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the first-order expressibility of recursive queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Some computational aspects of circumscription
Journal of the ACM (JACM)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bonded arity Datalog (≠) queries on graphs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universal finiteness and satisfiability (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semigroup techniques in recursive query optimization
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries with useful bindings
ACM Transactions on Database Systems (TODS)
Static analysis in datalog extensions
Journal of the ACM (JACM)
Linearizing Some Recursive Logic Programs
IEEE Transactions on Knowledge and Data Engineering
Decidability of First-Order Logic Queries over Views
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On Answering Queries in the Presence of Limited Access Patterns
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Answering Queries with Database Restrictions
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
DATALOG SIRUPs uniform boundedness is undecidable
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing complete answers to queries in the presence of limited access patterns
The VLDB Journal — The International Journal on Very Large Data Bases
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Linearisability on datalog programs
Theoretical Computer Science
Logic-based web information extraction
ACM SIGMOD Record
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
Decidable containment of recursive queries
Theoretical Computer Science - Database theory
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive Query Containment under Access Limitations
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Querying data sources that export infinite sets of views
Proceedings of the 12th International Conference on Database Theory
Boundedness of Monadic Second-Order Formulae over Finite Words
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Undecidability and intractability results concerning datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
Type inference for datalog with complex type hierarchies
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Logic in databases: report on the LID 2008 workshop
ACM SIGMOD Record
Database theory: query languages
Algorithms and theory of computation handbook
Determining relevance of accesses at runtime
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
More efficient datalog queries: subsumptive tabling beats magic sets
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Loops and overloops for tree walking automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Scalable OWL 2 reasoning for linked data
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Loops and overloops for Tree-Walking Automata
Theoretical Computer Science
Proceedings of the VLDB Endowment
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Boundedness of monadic FO over acyclic structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Query patterns for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
First-order rewritability of atomic queries in horn description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Information flow in trust management systems
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
Datalog is the language of logic programs without function symbols. It is used as a database query language. If it is possible to eliminate recursion from a Datalog program &Pgr;, then &Pgr; is said to be bounded. It is known that the problem of deciding whether a given Datalog program is bounded is undecidable, even for binary programs. We show here that boundedness is decidable for monadic programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity). Underlying our results are new tools for the optimization of Datalog programs based on automata theory and logic. In particular, one of the tools we develop is a theory of two-way alternating tree automata. We also use our techniques to show that containment for monadic programs is decidable.