Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
A Selective Semantics for Logic Programs with Preferences
2012
Gab12
Answer Set Programming (ASP), has become a prominent approach for Knowledge Representation and declarative problem solving. ASP has been extended with preferences and several semantics have been proposed. Among the available semantics, the so-called selective semantics have the property of always choosing preferred answer sets from among the standard answer sets, which is a desirable property in many applications. However, there exist programs which while having answer sets, have no preferred answer sets under the existing selective semantics. On the other hand, there are programs which, arguably, have too many preferred answer sets under existing semantics. We propose a new definition of preferred answer sets which is also selective, assigns at most one preferred answer set given a full prioritization of a program, and for negative-cycle-free programs the existence of a preferred answer set is guaranteed as in the case of standard logic programs.
In proceedings
Alfredo Gabaldon
13th European Conference on Logics in Artificial Intelligence (JELIA'12)
LNCS
Springer Berlin / Heidelberg
-
7519
215-227
978-3-642-33352-1
-
-
-
Export formats
Alfredo Gabaldon, A Selective Semantics for Logic Programs with Preferences, , 13th European Conference on Logics in Artificial Intelligence (JELIA'12), LNCS, Springer Berlin / Heidelberg, Vol. 7519, ISBN 978-3-642-33352-1, Pag. 215-227, 2012.
<a href="/people/members/view.php?code=3a9d10cb19eedc36960f68d303c27c0b" class="author">Alfredo Gabaldon</a>, <b>A Selective Semantics for Logic Programs with Preferences</b>, <u>13th European Conference on Logics in Artificial Intelligence (JELIA'12)</u>, LNCS, Springer Berlin / Heidelberg, Vol. 7519, ISBN 978-3-642-33352-1, Pag. 215-227, 2012.
@inproceedings {Gab12, author = {Alfredo Gabaldon}, title = {A Selective Semantics for Logic Programs with Preferences}, booktitle = {13th European Conference on Logics in Artificial Intelligence (JELIA'12)}, series = {LNCS}, publisher = {Springer Berlin / Heidelberg}, volume = {7519}, pages = {215-227}, isbn = {978-3-642-33352-1}, abstract = {Answer Set Programming (ASP), has become a prominent approach for Knowledge Representation and declarative problem solving. ASP has been extended with preferences and several semantics have been proposed. Among the available semantics, the so-called selective semantics have the property of always choosing preferred answer sets from among the standard answer sets, which is a desirable property in many applications. However, there exist programs which while having answer sets, have no preferred answer sets under the existing selective semantics. On the other hand, there are programs which, arguably, have too many preferred answer sets under existing semantics. We propose a new definition of preferred answer sets which is also selective, assigns at most one preferred answer set given a full prioritization of a program, and for negative-cycle-free programs the existence of a preferred answer set is guaranteed as in the case of standard logic programs.}, year = {2012}, }
Publication's urls
/publications/view.php?code=dddc4c2b192ffb1f6263a076e7721c05
/publications/view.php?code=Gab12
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT