On stratified autoepistemic theories

Authors:
Michael Gelfond
Affiliations:
Computer Science Department, The University of Texas at El Paso, El Paso, TX
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Year:
1987

Citing 4
Cited 7

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Closed-world databases and circumscription

Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Nonmonotonic Logic II: Nonmonotonic Modal Theories

Journal of the ACM (JACM)

Embedding nonground logic programs into autoepistemic logic for knowledge-base combination

ACM Transactions on Computational Logic (TOCL)
On the minimality of stable models

Logic programming, knowledge representation, and nonmonotonic reasoning
Fuzzy autoepistemic logic: reflecting about knowledge of truth degrees

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
To vladimir lifschitz on his 65th birthday

Correct Reasoning
Semantics For Disjunctive Logic Programs With Explicit And Default Negation

Fundamenta Informaticae
Answer set programming

RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Fuzzy autoepistemic logic and its relation to fuzzy answer set programming

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate some properties of "autoepistemic logic" approach to the formalization of common sense reasoning suggested by R. Moore in [Moore, 1985]. In particular we present a class of autoepistemic theories (called stratified autoepistemic theories) and prove that theories from this class have unique stable autoepistemic expansions and hence a clear notion of "theoremhood". These results are used to establish the relationship of Autoepistemic Logic with other formalizations of non-monotonic reasoning, such as negation as failure rule and circumscription. It is also shown that "classical" SLDNF resolution of Prolog can be used as a deductive mechanism for a rather broad class of autoepistemic theories. Key words and phrases: common sense reasoning, autoepistemic logic, negation as failure rule, non-monotonic reasoning. (Science section).