Data independent recursion in deductive databases
From MaRDI portal
Publication:1123651
DOI10.1016/0022-0000(89)90003-2zbMath0677.68108MaRDI QIDQ1123651
Publication date: 1989
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(89)90003-2
68Q25: Analysis of algorithms and problem complexity
68T99: Artificial intelligence
68P20: Information storage and retrieval of data
Related Items
PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE, Decidable containment of recursive queries, On the equivalence of recursive and nonrecursive Datalog programs, Controlling recursive inference, Can datalog be approximated?, One-sided recursions
Cites Work
- Undecidable optimization problems for database logic programs
- Implementation of logical query languages for databases
- On compiling queries in recursive first-order databases
- Minimizing function-free recursive inference rules
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Equivalences among Relational Expressions