Journal of Automated Reasoning

, Volume 45, Issue 1, pp 39–59

A New Default Theories Compilation for MSP-Entailment

Article

DOI: 10.1007/s10817-009-9150-9

Cite this article as:
Benferhat, S., Yahi, S. & Drias, H. J Autom Reasoning (2010) 45: 39. doi:10.1007/s10817-009-9150-9

Abstract

Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper focuses on a possibilistic approach, and more precisely on the MSP-entailment (where MSP stands for Minimum Specificity Principle) from default theories which is equivalent to System P augmented by rational monotony. In order to make this entailment tractable from a computational point of view, we propose here a compilation of default theories with respect to a target compilation language. This allows us to provide polynomial algorithms to derive efficiently the MSP-conclusions of a compiled default theory. Moreover, the proposed compilation is qualified to be flexible since it efficiently takes advantage of any classical compiler and generally provides a low recompilation cost when updating a compiled default theory.

Keywords

Default theoriesMSP entailmentKnowledge compilation

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Université Lille-Nord de FranceLensFrance
  2. 2.CRILLensFrance
  3. 3.CNRS UMR 8188LensFrance
  4. 4.Ecole nationale Supérieure d’InformatiqueAlgiersAlgeria
  5. 5.Université des Sciences et de la Technologie Houari BoumedieneAlgiersAlgeria