Reasoning with multiple-agent possibilistic logic
- Publication Type:
- Conference Proceeding
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, 9858 LNAI pp. 67 - 80
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© Springer International Publishing Switzerland 2016. 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.
Please use this identifier to cite or link to this item: