Static semantics for normal and disjunctive logic programs
- 1 June 1995
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 14 (2-4) , 323-357
- https://doi.org/10.1007/bf01530826
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Autoepistemic logic of knowledge and beliefsArtificial Intelligence, 1997
- Strong and explicit negation in non-monotonic reasoning and logic programmingLecture Notes in Computer Science, 1996
- Stable semantics for disjunctive programsNew Generation Computing, 1991
- Generalized well-founded semantics for logic programsPublished by Springer Nature ,1990
- Weak Generalized Closed World AssumptionJournal of Automated Reasoning, 1989
- Negation as failure using tight derivations for general logic programsThe Journal of Logic Programming, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- Inferring negative information from disjunctive databasesJournal of Automated Reasoning, 1988
- Semantical considerations on nonmonotonic logicArtificial Intelligence, 1985
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980