Ground Nonmonotonic Modal Logics
نویسندگان
چکیده
In this paper we address ground logics, a family of nonmonotonic modal logics, and their usage in knowledge representation. In such a setting non-modal sentences are used to represent the knowledge of an agent about the world, while an epistemic operator provides the agent with autoepistemic or introspective knowledge. Ground logics are based on the idea of characterizing the knowledge of the agent by allowing it to make nonmonotonic assumptions only with respect to the knowledge about the world, i.e. expressed by nonmodal formulae. They are characterized by a fix-point equation which determines the set of formulae derivable from the agent’s initial knowledge and which can be applied to different normal modal systems to obtain a variety of nonmonotonic modal logics. In the paper we address the semantical, computational and epistemological properties of ground logics. We provide a semantic characterization of ground logics by defining a preference relation on possible-world models based on the minimization of the knowledge expressed by nonmodal formulae. We analyze the computational complexity of reasoning in ground logics, providing both a lower bound through a reduction from quantified boolean formulae and an upper bound through an algorithm for computing logical entailment. We discuss the representational features of ground logics, in particular defaults, and provide a thorough comparison with McDermott and Doyle’s logics.
منابع مشابه
Reasoning about Minimal Knowledge in Nonmonotonic Modal Logics
We study the problem of embedding Halpern and Moses’s modal logic of minimal knowledge states into two families of modal formalism for nonmonotonic reasoning, McDermott and Doyle’s nonmonotonic modal logics and ground nonmonotonic modal logics. First, we prove that Halpern and Moses’s logic can be embedded into all ground logics; moreover, the translation employed allows for establishing a lowe...
متن کاملGround Nonmonotonic Modal Logics for Knowledge Representation
In this paper we discuss ground logics, a family of nonmonotonic modal logics, with the goal of using them in knowledge representation. Ground logics are based on the idea of minimizing the knowledge expressed by non-modal formulae. The nonmonotonic character of the logics can be described either by a x-point equation or by means of a preference relation on possible-worlds models. We address bo...
متن کاملA Uniform Tableaux Method for Nonmonotonic Modal Logics
We present a semantic tableaux calculus for propositional nonmonotonic modal logics, based on possible-worlds characterisations for nonmonotonic modal logics. This method is parametric with respect to both the modal logic and the preference semantics, since it handles in a uniform way the entailment problem for a wide class of nonmonotonic modal logics: McDermott and Doyle's logics and ground l...
متن کاملA Preference Semantics for Ground Nonmonotonic Modal Logics
In this paper we provide a semantic characterization of ground logics, a family of nonmonotonic modal logics obtained by means of a variant of the well known Mc Dermott and Doyle xed point equation. The term ground logics carries the idea of restricting the negative in-trospection capabilities of the reasoning agent to the objective (i.e. non modal) part of the theory. This intuition was nicely...
متن کاملGround Nonmonotonic Modal Logic S5: New Results
We study logic programs under Gelfond’s translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we also show that these logics are equivalent to a nonmonotonic logic that we construct using the well known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997