Sciweavers

Share
ECSQARU
2005
Springer

A Possibilistic Inconsistency Handling in Answer Set Programming

9 years 9 months ago
A Possibilistic Inconsistency Handling in Answer Set Programming
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set of formulas, an inconsistent program has no answer. Even if these two results seem opposite, they share the same drawback: the knowledge base is useless since one can not draw valid conclusions from it. Possibilistic logic is a logic of uncertainty able to deal with inconsistency in classical logic. By putting on every formula a degree of certainty, it defines a way to compute, with regard to these degrees, a consistent subset of formulas that can be then used in a classical inference process. In this work, we address the treatment of inconsistency in Answer Set Programming by a possibilistic approach that takes into account the non monotonic aspect of the framework.
Pascal Nicolas, Laurent Garcia, Igor Stépha
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ECSQARU
Authors Pascal Nicolas, Laurent Garcia, Igor Stéphan
Comments (0)
books