Sciweavers

Share
FLAIRS
2008

On the Compilation of Possibilistic Default Theories

11 years 2 months ago
On the Compilation of Possibilistic Default Theories
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 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 MSPconclusions 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.
Salem Benferhat, Safa Yahi, Habiba Drias
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where FLAIRS
Authors Salem Benferhat, Safa Yahi, Habiba Drias
Comments (0)
books