- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A progression semantics for first-order logic programs
Artificial Intelligence 250 (C):58-79 (2017)
Abstract
This article has no associated abstract. (fix it)
My notes
Similar books and articles
Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
Hybrid Probabilistic Logic Programs as Residuated Logic Programs.Carlos Damásio & Luís Pereira - 2002 - Studia Logica 72 (1):113-138.
Hybrid probabilistic logic programs as residuated logic programs.Carlos Viegas Damásio & Luís Moniz Pereira - 2002 - Studia Logica 72 (1):113 - 138.
The Refined Extension Principle for Semantics of Dynamic Logic Programming.José Júlio Alferes, Federico Banti, Antonio Brogi & João Alexandre Leite - 2005 - Studia Logica 79 (1):7-32.
A game semantics for disjunctive logic programming.Thanos Tsouanas - 2013 - Annals of Pure and Applied Logic 164 (11):1144-1175.
The Refined Extension Principle for Semantics of Dynamic Logic Programming.Joao Alexandre Leite - 2005 - Studia Logica 79 (1):7-32.
Lottery Semantics: A Compositional Semantics for Probabilistic First-Order Logic with Imperfect Information.Pietro Galliani & Allen L. Mann - 2013 - Studia Logica 101 (2):293-322.
Axiomatization of a Denotational Semantics for First-order Logic.C. Vermeulen - 2004 - Logic Journal of the IGPL 12 (4):277-299.
Issues in Knowledge Representation: Semantics and Knowledge Combination.Chitta Ranjan Baral - 1991 - Dissertation, University of Maryland, College Park
An alternative linear semantics for allowed logic programs.John Jeavons - 1997 - Annals of Pure and Applied Logic 84 (1):3-16.
Metalogic and the Overgeneration Argument.Salvatore Florio & Luca Incurvati - 2019 - Mind 128 (511):761-793.
Imperative programs as proofs via game semantics.Martin Churchill, Jim Laird & Guy McCusker - 2013 - Annals of Pure and Applied Logic 164 (11):1038-1078.
A general theory of confluent rewriting systems for logic programming and its applications.Jürgen Dix, Mauricio Osorio & Claudia Zepeda - 2001 - Annals of Pure and Applied Logic 108 (1-3):153-188.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,379,768)
6 months
6 (#509,139)
2020-12-22
Downloads
7 (#1,379,768)
6 months
6 (#509,139)
Historical graph of downloads
References found in this work
ASSAT: computing answer sets of a logic program by SAT solvers.Fangzhen Lin & Yuting Zhao - 2004 - Artificial Intelligence 157 (1-2):115-137.
Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
Infinitary equilibrium logic and strongly equivalent logic programs.Amelia Harrison, Vladimir Lifschitz, David Pearce & Agustín Valverde - 2017 - Artificial Intelligence 246 (C):22-33.
FLP answer set semantics without circular justifications for general logic programs.Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner & Jun Deng - 2014 - Artificial Intelligence 213 (C):1-41.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-55b469568f-2bmv2 uwo