Rules and meta-rules in possibility theory. From possibilistic logic to answer-set programming

Dubois, D; Prade, H; Schockaert, S

Rules and meta-rules in possibility theory. From possibilistic logic to answer-set programming

Dubois, D Prade, H

Schockaert, S

Permalink

Publication Type:: Journal Article
Citation:: Revue d'Intelligence Artificielle, 2012, 26 (1-2), pp. 63 - 83
Issue Date:: 2012-04-30

Closed Access

	Filename	Description	Size
	DocumentOpener.pdf	Published Version	1.81 MB	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.contributor.author	Schockaert, S	en_US
dc.date.issued	2012-04-30	en_US
dc.identifier.citation	Revue d'Intelligence Artificielle, 2012, 26 (1-2), pp. 63 - 83	en_US
dc.identifier.issn	0992-499X	en_US
dc.identifier.uri	http://hdl.handle.net/10453/114510
dc.description.abstract	The modeling of conditional/implicative rules of the form "if A then B" plays a crucial role in any attempt at formalizing reasoning. Starting from the expression of different forms of rules that have been identified in the setting of possibility theory, we study their counterparts in the framework of extensions of possibilistic logic. A distinction between rules and meta-rules is especially emphasized. The former contribute to the partial specification of a unique epistemic state, while the latter relate partially specified epistemic states, as in Answer Set Programming (ASP). The contribution of Pascal Nicolas to bridging the gap between possibilistic logic and ASP is discussed in this perspective. © 2012 Lavoisier.	en_US
dc.relation.ispartof	Revue d'Intelligence Artificielle	en_US
dc.relation.isbasedon	10.3166/RIA.26.63-83	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Rules and meta-rules in possibility theory. From possibilistic logic to answer-set programming	en_US
dc.type	Journal Article
utslib.citation.volume	1-2	en_US
utslib.citation.volume	26	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.issue	1-2	en_US
pubs.publication-status	Published	en_US
pubs.volume	26	en_US

Abstract:

The modeling of conditional/implicative rules of the form "if A then B" plays a crucial role in any attempt at formalizing reasoning. Starting from the expression of different forms of rules that have been identified in the setting of possibility theory, we study their counterparts in the framework of extensions of possibilistic logic. A distinction between rules and meta-rules is especially emphasized. The former contribute to the partial specification of a unique epistemic state, while the latter relate partially specified epistemic states, as in Answer Set Programming (ASP). The contribution of Pascal Nicolas to bridging the gap between possibilistic logic and ASP is discussed in this perspective. © 2012 Lavoisier.

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

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