A class of stratified programs in autoepistemic logic of knowledge and belief
Document Type
Conference Proceeding
Publication Date
1-1-1999
Abstract
Przymusinski proposed [11] AELB, the autoepistemic logic of knowledge and belief. The AELB logic is a very powerful and expressive formal system which isomorphically contains various major non-monotonic knowledge representation formalisms and major logic program semantics. Thus AELB can be used as a unifying framework for non-monotonic knowledge representation formalisms, which allows us to compare and better understand different formalizations of common-sense knowledge. The notion of “static autoepistemic expansion” forms the semantic basis for reasoning in AELB logic. However, not all AELB theories have consistent static expansions. In this paper, we identify a class of AELB theories, namely, the stratified AELB programs, and show that every stratified program has a unique consistent least static expansion. The existence of the consistent least static expansion is an important property which assures the usefulness of inferencing in such AELB theories.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
67
Last Page
75
Recommended Citation
Chen, J. (1999). A class of stratified programs in autoepistemic logic of knowledge and belief. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1609, 67-75. https://doi.org/10.1007/BFb0095091