Logic program semantics and circumscription of autoepistemic theories
- 9 May 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 50 (3) , 159-164
- https://doi.org/10.1016/0020-0190(94)00018-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Autoepistemic circumscription and logic programmingJournal of Automated Reasoning, 1993
- Short note preferred extensions are partial stable modelsThe Journal of Logic Programming, 1992
- Stable and extension class theory for logic programs and default logicsJournal of Automated Reasoning, 1992
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Semantics of disjunctive logic programs and deductive databasesPublished by Springer Nature ,1991
- Three-valued formalization of logic programmingPublished by Association for Computing Machinery (ACM) ,1990
- Stable models and non-determinism in logic programs with negationPublished by Association for Computing Machinery (ACM) ,1990
- Applications of circumscription to formalizing common-sense knowledgeArtificial Intelligence, 1986