On the equivalence of recursive and nonrecursive Datalog programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 4147465 (Why is no real title available?)
- scientific article; zbMATH DE number 176242 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A medvedev characterization of sets recognized by generalized finite automata
- Alternation
- Automata-theoretic techniques for modal logics of programs
- Computable queries for relational data bases
- Data independent recursion in deductive databases
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding Equivalence of Finite Tree Automata
- Elementary induction on abstract structures
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Horn clause queries and generalizations
- Logical query optimization by proof-tree transformation
- Minimizing function-free recursive inference rules
- On the equivalence of recursive and nonrecursive Datalog programs
- On the foundations of the universal relation model
- On the menbership problem for functional and multivalued dependencies in relational databases
- Parallel complexity of logical query programs
- Recursive queries and context-free graph grammars
- Recursively indefinite databases
- Relational queries computable in polynomial time
- Space-bounded reducibility among combinatorial problems
- Structure and complexity of relational queries
- The Complexity of Tree Automata and Logics of Programs
- Tree acceptors and some of their applications
- Undecidable boundedness problems for datalog programs
- Undecidable optimization problems for database logic programs
Cited in
(17)- On the equivalence of recursive and nonrecursive Datalog programs
- scientific article; zbMATH DE number 7561474 (Why is no real title available?)
- Permutation dependency in datalog programs
- Eliminating recursion from monadic datalog programs on trees
- scientific article; zbMATH DE number 4064537 (Why is no real title available?)
- Bounded arity Datalog \((\neq)\) queries on graphs
- Static analysis in Datalog extensions
- A note on fixpoint techniques in data base recursive logic programs
- Decidable containment of recursive queries
- Logic Programming and Nonmonotonic Reasoning
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
- Mathematical Foundations of Computer Science 2005
- scientific article; zbMATH DE number 176245 (Why is no real title available?)
- Inherent complexity of recursive queries
- Unifications, deunifications, and their complexity
- A single recursive predicate is sufficient for pure datalog
- Containment of conjunctive queries on annotated relations
This page was built for publication: On the equivalence of recursive and nonrecursive Datalog programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676421)
