Algorithms for possibility assessments: Coherence and extension

  • Authors:
  • Marco Baioletti;Davide Petturiti

  • Affiliations:
  • Dip. di Matematica e Informatica, Università degli Studi di Perugia, via Vanvitelli, 06123 Perugia, Italy;Dip. di Matematica e Informatica, Università degli Studi di Perugia, via Vanvitelli, 06123 Perugia, Italy

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.20

Visualization

Abstract

In this paper we study the computational aspects of coherence and extension of partial possibility assessments, both in an unconditional and a conditional setting, providing complexity results and algorithms for each problem. In particular, we propose an algorithm to check the coherence of a partial unconditional assessment which is based on propositional satisfiability. For the conditional case, we firstly prove a new characterization of coherent conditional assessments that allows us to define an algorithm again based on propositional satisfiability. The extension problem, in both settings, is solved by means of a search algorithm which relies on the corresponding coherence procedure.