Answer set general theories and preferences

Authors:
Mauricio Osorio;Claudia Zepeda
Affiliations:
CENTIA, Sta. Catarina Mártir, Cholula, Universidad de las Américas, Puebla, México;División de Estudios de Posgrado., Huajuapan de Leon, Universidad Tecnológica de la Mixteca, Oaxaca, México
Venue:
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Year:
2006

Citing 5
Cited 0

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programming with ordered disjunction

Eighteenth national conference on Artificial intelligence
Applications of intuitionistic logic in Answer Set Programming

Theory and Practice of Logic Programming
Planning with preferences using logic programming

Theory and Practice of Logic Programming
Answer set optimization

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce preference rules which allow us to specify preferences as an ordering among the possible solutions of a problem. Our approach allow us to express preferences for general theories. The formalism used to develop our work is Answer Set Programming. Two distinct semantics for preference logic programs are proposed. Finally, some properties that help us to understand these semantics are also presented.