Datalog LITE
- 1 January 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 3 (1), 42-79
- https://doi.org/10.1145/504077.504079
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Complexity and expressive power of logic programmingACM Computing Surveys, 2001
- On the Restraining Power of GuardsThe Journal of Symbolic Logic, 1999
- Succinctness as a source of complexity in logical formalismsAnnals of Pure and Applied Logic, 1999
- Low-complexity aggregation in GraphLog and DatalogTheoretical Computer Science, 1993
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Temporal logic programmingJournal of Symbolic Computation, 1989
- LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementationInformation Processing Letters, 1988
- Unification as a complexity measure for logic programmingThe Journal of Logic Programming, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Results on the propositional μ-calculusTheoretical Computer Science, 1983