Generalized possibilistic logic

Dubois, D; Prade, H

Generalized possibilistic logic

Dubois, D 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), 2011, 6929 LNAI pp. 428 - 432
Issue Date:: 2011-10-19

Closed Access

	Filename	Description	Size
	2013007838OK.pdf	Published version	215.87 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	Dubois, D	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.date.issued	2011-10-19	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6929 LNAI pp. 428 - 432	en_US
dc.identifier.isbn	9783642239625	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/32857
dc.description.abstract	Usual propositional possibilistic logic formulas are pairs made of a classical logic formula associated with a weight thought of as a lower bound of its necessity measure. In standard possibilistic logic, only conjunctions of such weighted formulas are allowed (a weighted classical conjunction is equivalent to the conjunction of its weighted conjuncts, due to the min-decomposability of necessity measures). However, the negation and the disjunction of possibilistic logic formulas make sense as well. They were briefly introduced by the authors some years ago, in a multiple agent logic context. The present paper hints at the multi-tiered logic that is thus generated, and discusses its semantics in terms of families of possibility distributions. Its practical interest for expressing higher order epistemic states is emphasized. © 2011 Springer-Verlag.	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-642-23963-2_33	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Generalized possibilistic logic	en_US
dc.type	Conference Proceeding
utslib.citation.volume	6929 LNAI	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	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	6929 LNAI	en_US

Abstract:

Usual propositional possibilistic logic formulas are pairs made of a classical logic formula associated with a weight thought of as a lower bound of its necessity measure. In standard possibilistic logic, only conjunctions of such weighted formulas are allowed (a weighted classical conjunction is equivalent to the conjunction of its weighted conjuncts, due to the min-decomposability of necessity measures). However, the negation and the disjunction of possibilistic logic formulas make sense as well. They were briefly introduced by the authors some years ago, in a multiple agent logic context. The present paper hints at the multi-tiered logic that is thus generated, and discusses its semantics in terms of families of possibility distributions. Its practical interest for expressing higher order epistemic states is emphasized. © 2011 Springer-Verlag.

Please use this identifier to cite or link to this item:

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