Skip Navigation

Journal of Logic and Computation 1997 7(4):523-548; doi:10.1093/logcom/7.4.523
© 1997 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by DONINI, F. M.
Right arrow Articles by ROSATI, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Ground Nonmonotonic Modal Logics

FRANCESCO M. DONINI, DANIELE NARDI and RICCARDO ROSATI

Dipartimento di Informatica e Sistemistica, Universita' di Roma "La Sapienza" Via Salaria 113, 00198 Roma, Italy

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 analyse 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.

Keywords: Knowledge representation; nonmonotonic reasoning; autoepistemic logics; computational complexity


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
M. O. Galindo, J. A. Navarro Perez, J. R. Arrazola Ramirez, and V. B. Macias
Logics with Common Weak Completions
J Logic Computation, December 1, 2006; 16(6): 867 - 890.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.