David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Classical ﬁxpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, three-valued, semantics uses ΦP, which extends TP to Kleene’s strong three-valued logic. Both these approaches generalize to cover logic programming systems based on a wide class of logics, provided only that the underlying structure be that of a bilattice. This was presented in earlier papers. Recently well-founded semantics has become inﬂuential for classical logic programs. We show how the well-founded approach also extends naturally to the same family of bilatticebased programming languages that the earlier ﬁxpoint approaches extended to. Doing so provides a natural semantics for logic programming systems that have already been proposed, as well as for a large number that are of only theoretical interest. And ﬁnally, doing so simpliﬁes the proofs of basic results about the well-founded semantics, by stripping away inessential details.
|Keywords||No keywords specified (fix it)|
|Categories||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
No citations found.
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.
Frederick Maier & Donald Nute (2010). Well-Founded Semantics for Defeasible Logic. Synthese 176 (2):243 - 274.
Edwin D. Mares (2004). “Four-Valued” Semantics for the Relevant Logic R. Journal of Philosophical Logic 33 (3):327-341.
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.
Melvin Fitting (2005). The Logic of Proofs, Semantically. Annals of Pure and Applied Logic 132 (1):1-25.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
L. Lismont (1994). Common Knowledge: Relating Anti-Founded Situation Semantics to Modal Logic Neighbourhood Semantics. [REVIEW] Journal of Logic, Language and Information 3 (4):285-302.
Added to index2010-12-22
Total downloads8 ( #194,740 of 1,679,382 )
Recent downloads (6 months)1 ( #182,933 of 1,679,382 )
How can I increase my downloads?