Reasoning with multiple-agent possibilistic logic

Belhadi, A; Dubois, D; Khellaf-Haned, F; Prade, H

Reasoning with multiple-agent possibilistic logic

Belhadi, A Dubois, D Khellaf-Haned, F Prade, H

Permalink

Publication Type:: Conference Proceeding
Citation:: 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:: 2016-01-01

Closed Access

	Filename	Description	Size
	belhadi_17240.pdf	Published version	246.95 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Belhadi, A	en_US
dc.contributor.author	Dubois, D	en_US
dc.contributor.author	Khellaf-Haned, F	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.date.issued	2016-01-01	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, 9858 LNAI pp. 67 - 80	en_US
dc.identifier.isbn	9783319458557	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120215
dc.description.abstract	© 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.	en_US
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-319-45856-4_5	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Reasoning with multiple-agent possibilistic logic	en_US
dc.type	Conference Proceeding
utslib.citation.volume	9858 LNAI	en_US
utslib.for	0804 Data Format	en_US
utslib.for	0803 Computer Software	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	9858 LNAI	en_US

Abstract:

© 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:

http://hdl.handle.net/10453/120215