Reasoning with Multiple-Agent Possibilistic Logic - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Reasoning with Multiple-Agent Possibilistic Logic


In multiple-agent logic, a formula is in the form of (a, A) where a is a propositional formula and A is a subset of agents. It states that at least all agents in A believe that a is true. This paper presents a method of refutation for this logic, based on a general resolution principle and using a linear strategy, which is sound and complete. This strategy is then extended so as to deal with certainty levels. It manipulates formulas in the form (a,α/A) expressing that all agents in set A believe at least at some level α that a is true. Finally, an experimental study is provided with the aim to estimate the performance of the proposed algorithms.
Fichier principal
Vignette du fichier
belhadi_17240.pdf (246.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01445235 , version 1 (24-01-2017)


  • HAL Id : hal-01445235 , version 1
  • OATAO : 17240


Asma Belhadi, Didier Dubois, Faiza Khellaf, Henri Prade. Reasoning with Multiple-Agent Possibilistic Logic. 10th International Conference on Scalable Uncertainty Management (SUM 2016), Oct 2016, Nice, France. pp. 67-80. ⟨hal-01445235⟩
72 View
86 Download


Gmail Facebook Twitter LinkedIn More