Quasi-Possibilistic Logic and its Measures of Information and Conflict

  • Authors:
  • Didier Dubois;Sébastien Konieczny;Henri Prade

  • Affiliations:
  • Institut de Recherche en Informatique de Toulouse, 31062 Toulouse, France;Institut de Recherche en Informatique de Toulouse, 31062 Toulouse, France;Institut de Recherche en Informatique de Toulouse, 31062 Toulouse, France

  • Venue:
  • Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Possibilistic logic and quasi-classical logic are two logics that were developed in artificial intelligence for coping with inconsistency in different ways, yet preserving the main features of classical logic. This paper presents a new logic, called quasi-possibilistic logic, that encompasses possibilistic logic and quasi-classical logic, and preserves the merits of both logics. Indeed, it can handle plain conflicts taking place at the same level of certainty (as in quasi-classical logic), and take advantage of the stratification of the knowledge base into certainty layers for introducing gradedness in conflict analysis (as in possibilistic logic). When querying knowledge bases, it may be of interest to evaluate the extent to which the relevant available information is precise and consistent. The paper review measures of (im)precision and inconsistency/conflict existing in possibilistic logic and quasi-classical logic, and proposes generalized measures in the unified framework.