A fixpoint semantics for disjunctive logic programs
- 31 July 1990
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 9 (1), 45-74
- https://doi.org/10.1016/0743-1066(90)90033-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On indefinite databases and the closed world assumptionPublished by Springer Nature ,2005
- Weak Generalized Closed World AssumptionJournal of Automated Reasoning, 1989
- Inferring negative information from disjunctive databasesJournal of Automated Reasoning, 1988
- Deduction in non-Horn databasesJournal of Automated Reasoning, 1985
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- An extension to linear resolution with selection functionInformation Processing Letters, 1982
- Negation as FailurePublished by Springer Nature ,1978
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Linear resolution with selection functionArtificial Intelligence, 1972