Abstract
Weight and cardinality constraints constitute a very useful programming construct widely adopted in Answer Set Programming (ASP). In recent work we have proposed RASP, an extension to plain ASP where complex forms of preferences can be flexibly expressed. In this paper, we illustrate an application of these preferences within weight/cardinality constraints. We emphasize, mainly by simple examples, the usefulness of the proposed extension. We also show how the semantics for ASP with weight constraints can be suitably extended so as to encompass RASP-like preferences, without affecting complexity.
This research is partially supported by PRIN-08 and GNCS-11. Material from this manuscript composes a poster presentation at Commonsense-2011 [2].
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
Capotorti, A., Formisano, A.: Comparative uncertainty: theory and automation. Mathematical Structures in Computer Science 18(1) (2008)
Costantini, S., Formisano, A.: Augmenting weight constraints with complex preferences. In: Proc. of Commonsense 2011. AAAI Press, Menlo Park (2011)
Costantini, S., Formisano, A., Petturiti, D.: Extending and implementing RASP. Fundamenta Informaticae 105(1-2) (2011)
Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence 20(12) (2004)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of the ICLP/SLP 1988. MIT Press, Cambridge (1988)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2) (2002)
Van Nieuwenborgh, D., Vermeir, D.: Preferred answer sets for ordered logic programs. Theory and Practice of Logic Programming 6(1-2) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costantini, S., Formisano, A. (2011). Weight Constraints with Preferences in ASP. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-20895-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20894-2
Online ISBN: 978-3-642-20895-9
eBook Packages: Computer ScienceComputer Science (R0)