The Well Founded Semantics for Disjunctive Logic Programs
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- A procedural semantics for well founded negation in logic programsPublished by Association for Computing Machinery (ACM) ,1989
- Every logic program has a natural stratification and an iterated least fixed point modelPublished by Association for Computing Machinery (ACM) ,1989
- Inferring negative information from disjunctive databasesJournal of Automated Reasoning, 1988
- 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
- The extended closed world assumption and its relationship to parallel circumscriptionPublished by Association for Computing Machinery (ACM) ,1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Universal UnificationPublished by Springer Nature ,1984