A transformation system for deductive database modules with perfect model semantics
- 22 March 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 110 (2) , 377-403
- https://doi.org/10.1016/0304-3975(93)90013-j
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the power of magicThe Journal of Logic Programming, 1991
- Completed logic programs and their consistencyThe Journal of Logic Programming, 1990
- Three-valued formalization of logic programmingPublished by Association for Computing Machinery (ACM) ,1990
- Stable models and non-determinism in logic programs with negationPublished by Association for Computing Machinery (ACM) ,1990
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- Every logic program has a natural stratification and an iterated least fixed point modelPublished by Association for Computing Machinery (ACM) ,1989
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988
- The Alexander Method — A technique for the processing of recursive axioms in deductive databasesNew Generation Computing, 1986
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985