Effective implementation of negation in database logic query languages
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 159-175
- https://doi.org/10.1007/bfb0021896
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Safe computation of the well-founded semantics of datalog queriesInformation Systems, 1992
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Stable models and non-determinism in logic programs with negationPublished by Association for Computing Machinery (ACM) ,1990
- 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
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Negation as FailurePublished by Springer Nature ,1978
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955