David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic programming semantics seems to exist side by side with similar work done for imperative and functional programming, with relatively minimal contact between communities. In this paper we summarize one variety of approaches to the semantics of logic programs: that based on ﬁxpoint theory. We do not attempt to cover much beyond this single area, which is already remarkably fruitful. We hope readers will see parallels with, and the divergences from the better known ﬁxpoint treatments developed for other programming methodologies.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
Massimo Warglien & Peter Gärdenfors (2013). Semantics, Conceptual Spaces, and the Meeting of Minds. Synthese 190 (12):2165-2193.
Chrysida Galanaki, Panos Rondogiannis & William W. Wadge (2008). An Infinite-Game Semantics for Well-Founded Negation in Logic Programming. Annals of Pure and Applied Logic 151 (2):70-88.
Thanos Tsouanas (2013). A Game Semantics for Disjunctive Logic Programming. Annals of Pure and Applied Logic 164 (11):1144-1175.
Similar books and articles
Carlos Viegas Damásio & Luís Moniz Pereira (2002). Hybrid Probabilistic Logic Programs as Residuated Logic Programs. Studia Logica 72 (1):113 - 138.
Martin Davis (1990). Book Review: Melvin Fitting. Computability Theory, Semantics, and Logic Programming. [REVIEW] Notre Dame Journal of Formal Logic 31 (3):485-486.
Yining Wu, Martin Caminada & Dov M. Gabbay (2009). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93 (2/3):383 - 403.
José Júlio Alferes, Federico Banti, Antonio Brogi & João Alexandre Leite (2005). The Refined Extension Principle for Semantics of Dynamic Logic Programming. Studia Logica 79 (1):7 - 32.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
Giangiacomo Gerla (2005). Fuzzy Logic Programming and Fuzzy Control. Studia Logica 79 (2):231 - 254.
Added to index2010-12-22
Total downloads4 ( #240,681 of 1,096,518 )
Recent downloads (6 months)1 ( #246,097 of 1,096,518 )
How can I increase my downloads?