Temporal stratification tests for linear and branching-time deductive databases
From MaRDI portal
Publication:2566298
DOI10.1016/j.tcs.2005.05.014zbMath1077.68025OpenAlexW2049272900MaRDI QIDQ2566298
Manolis Gergatsoulis, Christos Nomikos, Panos Rondogiannis
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.05.014
Related Items
Positive Dedalus programs tolerate non-causality ⋮ Locally stratified Boolean grammars ⋮ Temporal stratification tests for linear and branching-time deductive databases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amortized efficiency of a path retrieval data structure
- Testing logic programs for local stratification
- Parallel concepts in graph theory
- Temporal stratification tests for linear and branching-time deductive databases
- A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING
- Depth-bounded bottom-up evaluation of logic programs
- Towards a unified theory of intensional logic programming
- Logic programming and negation: A survey
- The deductive database system [Lscr [Dscr ][Lscr ]++]
- Branching-time logic programming: the language Cactus and its applications
- Faster Scaling Algorithms for Network Problems
- Stratified negation in temporal logic programming and the cycle-sum test
- The branching-time transformation technique for chain datalog programs
This page was built for publication: Temporal stratification tests for linear and branching-time deductive databases
