Abstract
In recent work, we provided a formulation of ASP programs in terms of linear logic theories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, “Resource-based Answer Set Semantics”.
Research partially funded by INdAM-GNCS-2013 project.
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
Costantini, S., Formisano, A.: Answer set programming with resources. Journal of Logic and Computation 20(2), 533–571 (2010)
Costantini, S., Formisano, A.: Modeling preferences and conditional preferences on resource consumption and production in ASP. Journal of Algorithms in Cognition, Informatics and Logic 64(1), 3–15 (2009)
Costantini, S., Formisano, A., Petturiti, D.: Extending and implementing RASP. Fundamenta Informaticae 105(1-2), 1–33 (2010)
Costantini, S., Formisano, A.: RASP and ASP as a fragment of linear logic. Journal of Applied Non-Classical Logics (JANCL) (2013)
Girard, J.Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)
Kanovich, M.I.: The complexity of Horn fragments of linear logic. Ann. Pure Appl. Logic 69(2-3), 195–241 (1994)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proc. of the 5th Intl. Conference and Symposium on Logic Programming, pp. 1070–1080. The MIT Press (1988)
Costantini, S.: Contributions to the stable model semantics of logic programs with negation. Theoretical Computer Science 149(2), 231–255 (1995)
Dix, J.: A classification theory of semantics of normal logic programs, I and II. Fundam. Inform. 22(3), 227–255, 257–288 (1995)
Pereira, L.M., Pinto, A.M.: Revised stable models – A semantics for logic programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol. 3808, pp. 29–42. Springer, Heidelberg (2005)
Pereira, L.M., Pinto, A.M.: Tight semantics for logic programs. In: Hermenegildo, M.V., Schaub, T. (eds.) Tech. Comm. of the 26th Intl. Conference on Logic Programming, ICLP 2010. LIPIcs, vol. 7, pp. 134–143 (2010)
Osorio, M., López, A.: Expressing the stable semantics in terms of the pstable semantics. In: Proc. of the LoLaCOM 2006 Workshop. CEUR Workshop Proc., vol. 220, CEUR-WS.org (2006)
Osorio, M., Pérez, J.A.N., Ramírez, J.R.A., Macías, V.B.: Logics with common weak completions. J. Log. Comput. 16(6), 867–890 (2006)
Cadoli, M.: The complexity of model checking for circumscriptive formulae. Inf. Process. Lett. 44(3), 113–118 (1992)
Costantini, S.: On the existence of stable models of non-stratified logic programs. Theory and Practice of Logic Programming 6(1-2) (2006)
Lifschitz, V., Turner, H.: Splitting a logic program. In: Proc. of the Intl. Conference on Logic Programming, ICLP 1994, pp. 23–37 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costantini, S., Formisano, A. (2013). Negation as a Resource: A Novel View on Answer Set Semantics. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-40564-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40563-1
Online ISBN: 978-3-642-40564-8
eBook Packages: Computer ScienceComputer Science (R0)