Abstract
Intensional logic programming is an extension of logic programming based on intensional logic, which includes as special cases both temporal and modal logic programming. In [OW92], M. Orgun and W. W. Wadge provided a general framework for capturing the semantics of intensional logic programming languages. One key property involved in the construction of [OW92], is the monotonicity of intensional operators. In this paper we consider intensional logic programming from a game-theoretic perspective. In particular we define a two-person game and we demonstrate that it is equivalent to the semantics of [OW92]. More importantly, we demonstrate that the game is even applicable to intensional languages with non-monotonic operators. In this way we provide the first (to our knowledge) general semantic framework for capturing the semantics of non-monotonic intensional logic programming.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research was supported by the project “Handling Uncertainty in Data Intensive Applications”, co-financed by the European Union (European Social Fund) and Greek national funds, through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF) - Research Program: THALES, Investing in knowledge society through the European Social Fund.
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
Di Cosmo, R., Loddo, J.-V., Nicolet, S.: A Game Semantics Foundation for Logic Programming. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol. 1490, pp. 355–373. Springer, Heidelberg (1998)
Fariñas del Cerro, L.: MOLOG: A System that Extends PROLOG with Modal Logic. New Generation Computing 4, 35–50 (1986)
Galanaki, C., Rondogiannis, P., Wadge, W.W.: An Infinite-Game Semantics for Well-Founded Negation in Logic Programming. Annals of Pure and Applied Logic 151(2-3), 70–88 (2008)
Gale, D., Stewart, F.M.: Infinite Games with Perfect Information. Annals of Mathematical Studies 28, 245–266 (1953)
Martin, D.A.: Borel Determinacy. Annals of Math. 102, 363–371 (1975)
Montague, R.: English as a Formal Language. In: Thomason, R.H. (ed.) Formal Philosophy: Selected Papers of Richard Montague, pp. 108–221. Yale University Press (1974)
Moschovakis, Y.N.: Descriptive Set Theory. North-Holland (1980)
Moszkowski, B.C.: Executing Temporal Logic Programs. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 111–130. Springer, Heidelberg (1985)
Orgun, M.A.P., Wadge, W.W.: Towards a Unified Theory of Intensional Logic Programming. Journal of Logic Programming 13(4), 413–440 (1992)
Rondogiannis, P., Wadge, W.W.: Minimum Model Semantics for Logic Programs with Negation-as-Failure. ACM Transactions on Computational Logic 6(2), 441–467 (2005)
Scott, D.: Advice on Modal Logic. In: Lambert, K. (ed.) Philosophical Problems in Logic, pp. 143–173. D. Reidel Publishing Company (1970)
Tsouanas, T.: A Game Semantics Approach to Disjunctive Logic Programs. In: GALOP Workshop, Saarbrücken, Germany (2011)
van Emden, M.H.: Quantitative Deduction and its Fixpoint Theory. Journal of Logic Programming 3(1), 37–53 (1986)
De Vos, M.: Logic Programming, Decisions and Games. PhD thesis, Vrije Universiteit Brussel (2001)
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
Galanaki, C., Nomikos, C., Rondogiannis, P. (2013). Game Semantics for Non-monotonic Intensional Logic Programming. 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_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-40564-8_33
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)