On the semantics of logic programs with preferences

Authors:
Sergio Greco;Irina Trubitsyna;Ester Zumpano
Affiliations:
DEIS, University of Calabria, Rende, Italy;DEIS, University of Calabria, Rende, Italy;DEIS, University of Calabria, Rende, Italy
Venue:
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Year:
2006

Citing 19
Cited 1

Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Answer sets for prioritized logic programs

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Preferred answer sets for extended logic programs

Artificial Intelligence
Disjunctive logic programs with inheritance

Proceedings of the 1999 international conference on Logic programming
Prioritized logic programming and its application to commonsense reasoning

Artificial Intelligence
Reasoning with Prioritized Defaults

LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Prioritizing Default Logic

Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
A Compilation of Brewka and Eiter's Approach to Prioritization

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Preferred Answer Sets for Ordered Logic Programs

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Nonmonotonic Reasoning by Monotonic Inference with Priority Constraints

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Alternating Fixpoint Theory for Logic Programs with Priority

CL '00 Proceedings of the First International Conference on Computational Logic
Logic programming with ordered disjunction

Eighteenth national conference on Artificial intelligence
A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming
Prioritized component systems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Well-founded semantics for extended logic programs with dynamic preferences

Journal of Artificial Intelligence Research
Answer set optimization

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A comparative study of logic programs with preference

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
nomore: a system for computing preferred answer sets

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

On the semantics of logic programs with preferences

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is a contribution to realizing prioritized reasoning in logic programming in the presence of preference relations involving atoms. In more details, the case of dynamic preferences is investigated and a semantics interpreting each preference rule as a tool for representing a choice over alternative options is proposed. The technique, providing a new interpretation for prioritized logic programs, is inspired by the one proposed by Sakama and Inoue in [19] and enriched with the use of structural information of preference rules as proposed by Brewka et al. in [6]. Specifically, the analysis of the logic program is carried out together with the analysis of preferences in order to determine the choice order and the sets of comparable models. The proposed approach is compared with those in [6, 19]. Complexity analysis is also performed showing that the use of additional information does not increase the complexity of computing preferred stable models.