A possibilistic inconsistency handling in answer set programming

Authors:
Pascal Nicolas;Laurent Garcia;Igor Stéphan
Affiliations:
LERIA, University of Angers, France;LERIA, University of Angers, France;LERIA, University of Angers, France
Venue:
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2005

Citing 6
Cited 2

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
A Brief Overview of Over-Constrained Systems

Over-Constrained Systems
Preferred subtheories: an extended logical framework for default reasoning

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Possibilistic stable models

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Handling uncertainty and defeasibility in a possibilistic logic setting

International Journal of Approximate Reasoning
Possibilistic stable models

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.