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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balduccini, M., Mellarkod, V.S.: A-prolog with cr-rules and ordered disjunction. In: International Conference on Intelligent Sensing and Information Processing, pp. 1–6 (2004)
Brewka, G.: Logic Programming with Ordered Disjunction. In: Proceedings of the 18th National Conference on Artificial Intelligence, AAAI-2002, Morgan Kaufmann, San Francisco (2002)
Brewka, G., Niemela, I., Truszczynski, M.: AnswerSet Optimization. In: IJCAI 2003, pp. 867–872 (2003)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Kowalski, R., Bowen, K. (eds.) 5th Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2, 526–541 (2001)
Osorio, M., Navarro, J.A., Arrazola, J.: Safe beliefs for propositional theories. Annals of Pure and Applied Logic 134(1), 63–82 (2005)
Osorio, M., Navarro, J.A., Arrazola, J.: Applications of Intuitionistic Logic in Answer Set Programming. Theory and Practice of Logic Programming (TPLP) 4, 325–354 (2004)
Osorio, M., Ortiz, M., Zepeda, C.: Using CR-rules for evacuation planning. In: Luna, G.D.I., Chaves, O.F., Galindo, M.O. (eds.) IX Ibero-american Workshops on Artificial Inteligence, pp. 56–63 (2004)
Pearce, D.: Stable Inference as Intuitionistic Validity. Logic Programming 38, 79–91 (1999)
Son, T.C., Pontelli, E.: Planning with Preferences Using Logic Programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 247–260. Springer, Heidelberg (2003)
Zepeda, C.: Evacuation Planning using Answer Sets. PhD thesis, Universidad de las Americas, Puebla and Institut National des Sciences Appliquées de Lyon (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osorio, M., Zepeda, C. (2006). Answer Set General Theories and Preferences. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_6
Download citation
DOI: https://doi.org/10.1007/11925231_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)