Extending answer set programming using generalized possibilistic logic

Dubois, D; Prade, H; Schockaert, S

Extending answer set programming using generalized possibilistic logic

Dubois, D Prade, H

Schockaert, S

Permalink

Publication Type:: Conference Proceeding
Citation:: CEUR Workshop Proceedings, 2015, 1517
Issue Date:: 2015-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (171.28 kB)

View statistics

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	2015-01-01	en_US
dc.identifier.citation	CEUR Workshop Proceedings, 2015, 1517	en_US
dc.identifier.issn	1613-0073	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120639
dc.description.abstract	© Copyright 2015, for this paper by its authors. Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. This short paper briefly explains how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characterizations of the stable model semantics. First, unlike reduct-based approaches, it does not rely on a syntactic procedure: we can directly characterize answer sets based on the minimally specific models of a GPL theory. Second, GPL enables us to study extensions of ASP in an intuitive way: unlike in existing generalizations of ASP such as equilibrium logic and autoepistemic logic, all formulas in GPL have a meaning which is intuitively clear. Finally, being based on possibilistic logic, GPL offers a natural way of dealing with uncertainty in answer set programs.	en_US
dc.relation.ispartof	CEUR Workshop Proceedings	en_US
dc.title	Extending answer set programming using generalized possibilistic logic	en_US
dc.type	Conference Proceeding
utslib.citation.volume	1517	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	open_access
pubs.publication-status	Published	en_US
pubs.volume	1517	en_US

Abstract:

© Copyright 2015, for this paper by its authors. Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. This short paper briefly explains how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characterizations of the stable model semantics. First, unlike reduct-based approaches, it does not rely on a syntactic procedure: we can directly characterize answer sets based on the minimally specific models of a GPL theory. Second, GPL enables us to study extensions of ASP in an intuitive way: unlike in existing generalizations of ASP such as equilibrium logic and autoepistemic logic, all formulas in GPL have a meaning which is intuitively clear. Finally, being based on possibilistic logic, GPL offers a natural way of dealing with uncertainty in answer set programs.

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

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