Abstract

The paper is an epistemological analysis of logic programming and shows an epistemological ambiguity. Many different logic programming formalisms and semantics have been proposed. Hence, logic programming can be seen as a family of formal logics, each induced by a pair of a syntax and a semantics, and each having a different declarative reading. However, we may expect that (a) if a program belongs to different logics of this family and has the same formal semantics in these logics, then the declarative meaning attributed to this program in the different logics is equivalent, and (b) that one and the same logic in this family has not been associated with distinct declarative readings.

Citations

1263	The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
1247	A logic for default reasoning - Reiter - 1980
855	Negation as Failure - Clark - 1978
743	The Well-Founded Semantics for General Logic Programs - Gelder, Ross, et al. - 1991
689	Classical negation in logic programs and disjunctive databases - Gelfond, Lifschitz - 1991
641	Predicate logic as a programming language - Kowalski - 1974
570	Towards a theory of declarative knowledge - Apt, Blair, et al. - 1988
464	F.: Abductive Logic Programming - Kakas, Kowalski, et al. - 1992
407	Semantical considerations on nonmonotonic logic - Moore - 1985
370	Knowledge representation, reasoning and declarative problem solving - Baral - 2003
310	Logic programs with classical negation - Gelfond, Lifschitz - 1990
197	Stable Models as an Alternative Logic Programming Paradigm - Marek, Truszczyński - 1999
160	Acyclic programs - Apt, Bezem - 1991
127	Answer set planning - Lifschitz - 1999
103	On stratified autoepistemic theories - Gelfond - 1987
96	Answer Set Programming and Plan Generation - Lifschitz
66	Logic programming and knowledge representation – the A-Prolog perspective - Gelfond, Leone
55	Representing Knowledge in A-Prolog - Gelfond - 2002
45	Stable semantics for logic programs and default theories - Marek, Truszczyński - 1989
38	The well-founded semantics is the principle of inductive definition - Denecker - 1998
33	Logic programming revisited: logic programs as inductive definitions - Denecker, Bruynooghe, et al. - 2001
31	Uniform semantic treatment of default and autoepistemic logics - Denecker, Marek, et al. - 2003
29	A logic of nonmonotone inductive definitions and its modularity properties - Denecker, Ternovska - 2004
27	Definitions in answer set programming - Erdo˘gan, Lifschitz - 2004
21	Inductive situation calculus - Denecker, Ternovska - 2007
19	In defence of logic - Hayes - 1977
16	Logic programs with stable model semantics as a constraint programming paradigm - Niemel - 1999
2	number 2407 - Kowalski