Abstract
The present work proposes a new semantics for logic program with preference rules and studies logic programs enriched with both aggregates and preference rules. The interest of research literature in handling user preferences to express a partial order on rules and literals is reflected by an extensive number of proposals. The association of aggregates and preferences is, here, used to also express a partial order on global models, other than on literals and rules, so that optimization problems can be expressed in a simple and elegant way. The use of aggregates makes logic languages more flexible and intuitive, without any additional computational complexity.
This is a preview of subscription content, log in via an institution to check access.
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
Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109(1-2), 297–356 (1999)
Brewka, G.: Logic programming with ordered disjunction. In: AAAI/IAAI, pp. 100–105 (2002)
Brewka, G., Niemela, I., Truszczynski, M.: Answer Set Optimization. IJCAI (2003)
Buccafurri, F., Faber, W., Leone, N.: Disjunctive deductive databases with inheritance. In: Int. Conf. on Logc Programming, pp. 79–93 (1999)
Brewka, G.: Complex Preferences for Answer Set Optimization. In: KR, pp. 213–223 (2004)
Delgrande, J.P., Schaub, T., Tompits, H.: Logic Programs with Compiled Preferences. In: ECAI, pp. 464–468 (2000)
Delgrande, J.P., Schaub, T., Tompits, H.: A Framework for Compiling Preferences in Logic Programs. TPLP 3(2), 129–187 (2003)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. TODS 22(3), 364–418 (1997)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proc. of Fifth Conf. on Logic Programming, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Gelfond, M., Son, T.C.: Reasoning with prioritized defaults. In: LPKR, pp. 164–223 (1997)
Govindarajan, K., Jayaraman, B., Mantha, S.: Preference Logic Programming. In: ICLP, pp. 731–746 (1995)
Greco, S.: Dynamic Programming in Datalog with Aggregates. IEEE Trans. Knowl. Data Eng. 11(2), 265–283 (1999)
Greco, S., Saccà, D.: Search and Optimization Problems in Datalog. In: Computational Logic: Logic Programming and Beyond, pp. 61–82 (2002)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Przymusinski, T.: Stable semantics for disjunctive programs. NGC 9(3/4), 401–424 (1991)
Sakama, C., Inoue, K.: Representing priorities in logic programs. In: JICSLP, pp. 82–96 (1996)
Sakama, C., Inoue, K.: Priorized logic programming and its application to commonsense reasoning. Artificial Intelligence (123), 185–222 (2000)
Schaub, T., Wang, K.: A Comparative Study of Logic Programs with Preference. In: IJCAI, pp. 597–602 (2001)
Wakaki, T., Inoue, K., Sakama, C., Nitta, K.: Computing Preferred Answer Sets in Answer Set Programming. In: LPAR Conf., pp. 259–273 (2003)
Wang, X., You, J.H., Yuan, L.Y.: Nonmonotonic reasoning by monotonic inferences with priority conditions. In: NMELP, pp. 91–109 (1996)
Wang, K., Zhou, L., Lin, F.: Alternating Fixpoint Theory for Logic Programs with Priority. Computational Logic, 164–178 (2000)
Zhang, Y., Foo, N.: Answer sets for prioritized logic programs. In: ILPS, pp. 69–83 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greco, S., Trubitsyna, I., Zumpano, E. (2005). Aggregates and Preferences in Logic Programming. In: Hacid, MS., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds) Foundations of Intelligent Systems. ISMIS 2005. Lecture Notes in Computer Science(), vol 3488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11425274_43
Download citation
DOI: https://doi.org/10.1007/11425274_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25878-0
Online ISBN: 978-3-540-31949-8
eBook Packages: Computer ScienceComputer Science (R0)