A logic of knowledge and justified assumptions
Fangzhen Lin, Yoav Shoham
Abstract
Fangzhen Lin, Yoav Shoham
Abstract
In this paper we define the logic GK of knowledge and justified assumptions. GK is best understood as a formalization of autoepistemic reasoning processes that are more general than those in Moore's autoepistemic logic, and is formally defined via a modification of Shoham's preference semantics. We show that GK includes not only Moore's autoepistemic logic, but also Reiter's default logic. To our knowledge GK is the first complete semantic unification of the two logics. Similarly to circumscription, GK is based on the notion of logical minimization, and thus provides a bridge between circumscription and fixed-point nonmonotonic logics, an outstanding problem in nonmonotonic logics. As an application of this bridge, we propose a formalization of logic programs with negation-as-failure in circumscription.
OpenAlex reports 59 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we define the logic GK of knowledge and justified assumptions. GK is best understood as a formalization of autoepistemic reasoning processes that are more general than those in Moore's autoepistemic logic, and is formally defined via a modification of Shoham's preference semantics. We show that GK includes not only Moore's autoepistemic logic, but also Reiter's default logic. To our knowledge GK is the first complete semantic unification of the two logics. Similarly to circumscription, GK is based on the notion of logical minimization, and thus provides a bridge between circumscription and fixed-point nonmonotonic logics, an outstanding problem in nonmonotonic logics. As an application of this bridge, we propose a formalization of logic programs with negation-as-failure in circumscription.
Key concepts: Circumscription, Non-monotonic logic, Autoepistemic logic, Default logic, Unification, Negation, Stable model semantics, Computer science