A procedural semantics for well-founded negation in logic programs
- 31 May 1992
- journal article
- Published by Elsevier BV in The Journal of Logic Programming
- Vol. 13 (1), 1-22
- https://doi.org/10.1016/0743-1066(92)90019-y
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (IRI-87-22886)
- Air Force Office of Scientific Research (AFOSR-88-0266)
- International Business Machines Corporation
This publication has 21 references indexed in Scilit:
- On indefinite databases and the closed world assumptionPublished by Springer Science and Business Media LLC ,2005
- A procedural semantics for well-founded negation in logic programsThe Journal of Logic Programming, 1992
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Negation as failure using tight derivations for general logic programsThe Journal of Logic Programming, 1989
- Negation in logic programmingThe Journal of Logic Programming, 1987
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Negation as failure. IIThe Journal of Logic Programming, 1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976