Abstract
In this paper we follow ideas from our Equational approach to argumentation, [3,4], and develop the Equational approach to Logic programs. We regard a logic program P as a template for generating a system of equations Eq(P), where the literals are considered variables ranging over the unit interval [0, 1], and where the solutions to the equations give us the logical meaning of the logic program. We show soundness of the equational approach with respect to traditional Prolog computation and with respect to answer set programming. We prove completeness of answer sets for P with respect to {0,1} solutions of Eq(P) for programs with only negated atoms in the body of clauses. We offer equational semantics for logic programs with negation as failure in the spirit of Clark’s completion.
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
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer (1987)
Clark, K.: Negation as failure. Originally published in 1978, and reproduced in Readings in nonmonotonic reasoning. Morgan Kaufmann Publishers, pp. 311–325 (1987)
Gabbay, D.: An Equational Approach to Argumentation Networks, p. 107 (February 2011). To Appear in Argumentation and Computation (2012); Special double issue on numerical and equational argumentation networks
Gabbay, D.M.: Introducing Equational Semantics for Argumentation Networks. In: Liu, W. (ed.) ECSQARU 2011. LNCS (LNAI), vol. 6717, pp. 19–35. Springer, Heidelberg (2011)
Lifschitz, V.: What is answer set programming? (2008), http://www.cs.utexas.edu/~vl/papers/wiasp.pdf
Caminada, M., Gabbay, D.: A logical account of formal argumentation. Studia Logica 93(2-3), 109–145 (2009)
Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence. Springer (2009)
Sobolev, V.I.: Brouwer theorem. In: Hazewinkel, M. (ed.) Encyclopaedia of Mathematics. Springer (2001), For Brouwer Fixed Point Theorem, http://en.wikipedia.org/wiki/Brouwer_fixed_point_theorem
Son, T.C.: Answer Set Programming Tutorial (October 2005), http://www.cs.nmsu.edu/~tson/tutorials/asp-tutorial.pdf
Gabbay, D.: Fibring argumentation frames. Studia Logica 93(2-3), 231–295 (2009)
Gabbay, D., d’Avila Garcez, A.: Logical modes of attack in argumentation networks. Studia Logica 93(2-3), 199–230 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gabbay, D.M. (2012). An Equational Approach to Logic Programming. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-30743-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30742-3
Online ISBN: 978-3-642-30743-0
eBook Packages: Computer ScienceComputer Science (R0)