Abstract
We present a games semantics of \({\ensuremath{\mathit AnsProlog}}\) with single headed clauses. Using the semantics, we derive tools for the assistance of verification of programs and tools based on those programs, a well as proposing a solver that grounds on the fly.
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
References
Baral, C.: Knowledge Representation, reasoning and declarative problem solving with Answer Sets. Cambridge University Press, Cambridge (2003)
Brain, M., De Vos, M.: Debugging logic programs under the answer set semantics. ASP, pp. 141–152 (2005)
Ghica, D.R., McCusker, G.: Reasoning about idealised algol using regular languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, Springer, Heidelberg (2000)
Lorenzen, P.: Ein dialogisches konstruktivitatskriterium. In: Symp. Foundations of Mathematics, volume Infinitistic Methods, pp. 193–200, Warsaw, PWN (1961)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Needham, J., De Vos, M. (2007). A Games Semantics of ASP. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-74610-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74608-9
Online ISBN: 978-3-540-74610-2
eBook Packages: Computer ScienceComputer Science (R0)