Abstract:
We consider propositional logic programs with negations. We define notions of constructive transformation and constructive completion of a program. We use these notions to characterize SLDNF-resolution in classical, intuitionistic and intermediate logics, and also to derive a characterization in modal logics of knowledge. We show that the three-valued and four-valued fix-point or declarative semantics for program P are equivalent to the two-valued semantics for the constructive version of P. We argue that it would be beneficial to replace Negation as Failure by constructive transformation, and it would be beneficial to use the two-valued semantics for the constructive version of the program instead of multivalued semantics for the original program.
Citations
|
332
|
A Kripke-Kleene semantics for logic programs
– Fitting
- 1985
|
|
226
|
A useful four-valued logic
– Belnap
- 1977
|
|
221
|
Logic Programming and Negation: A Survey
– Apt, Bol
|
|
163
|
First-order Modal Logic
– Fitting, Mendelsohn
- 1998
|
|
149
|
A logical analysis of modules in logic programming
– Miller
- 1989
|
|
95
|
Signed data dependencies in logic programs
– Kunen
- 1989
|
|
86
|
Foundations of Logic Programming (second, extended edition
– LLOYD
- 1987
|
|
84
|
Predicate logic as a computational formalism
– Clark
- 1979
|
|
77
|
N-Prolog: An Extension of Prolog with Hypothetical Implications
– Gabbay, Reyle
- 1984
|
|
69
|
Intuitionistic logic, model theory and forcing
– Fitting
- 1969
|
|
37
|
A trasformational approach to negation in logic programming
– Barbuti, Mancarella, et al.
- 1990
|
|
21
|
The Relation Between Logic Programming and Logic Specification
– Kowalski
- 1985
|
|
19
|
Completeness of the Negation as Failure Rule
– Jaffar, Lassez, et al.
- 1983
|
|
12
|
A complete axiomatization of the three-valued completion of logic programs
– Stark
- 1991
|
|
9
|
Commonsense axiomatizations for logic programs
– Gelder, Schlipf
- 1993
|
|
8
|
From Logic Programs to Inductive Definitions
– Stark
- 1993
|
|
6
|
Fully Declarative Logic Programming
– Plaza
- 1992
|
|
4
|
Intensional Negation of Logic Programs: Examples and Implementation Techniques
– Barbuti, Mancarella, et al.
- 1987
|
|
4
|
Algebraic Properties of a Class of Logic Programs
– Mancarella, Pedreschi, et al.
- 1990
|
|
4
|
Fully Declarative Programming with Logic
– Plaza
- 1990
|
|
3
|
Modal Provability Foundations for Negation by Failure
– Gabbay
- 1986
|
|
2
|
Completeness for propositional logic programs with negation, in: Methodologies for Intelligent Systems, 6th International Symposium, edited by Z
– Plaza
- 1991
|
|
2
|
Non-classical logics, An Algebraic Approach
– Rasiowa
- 1974
|
|
1
|
Modal Logic and Negation as Failure
– Balbiani
- 1991
|
|
1
|
Negation as Failure," in Logic and Databases, edited by H
– Clark
- 1978
|
|
1
|
and M.Martelli, "Strict Completion of Logic Programs
– Drabent
- 1991
|
|
1
|
Gentzen-style Characterizations of Negation as Failure
– Plaza
- 1992
|
|
