Abstract. Recently several authors have stressed and illustrated the importance of including a second kind of negation (explicit negation) in logic programs besides "negation as failure", and its use in deductive databases, knowledge representation, and nonmonotonic reasoning. By introducing explicit negation into logic programs contradiction may appear. In this work we present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based on a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction. The work is divided into two parts: one is presented in this paper, and comprises the contradiction avoidance approach, and the other in [16] in this volume, comprises the contradiction removal approach and shows the equivalence between the avoidance and removal approaches. 1
|
1126
|
The Stable Model Semantics for Logic Programming
– Gelfond, Lifschitz
- 1988
|
|
697
|
The Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1991
|
|
660
|
A theory of diagnosis from first principles
– Reiter
- 1987
|
|
342
|
A logical framework for default reasoning
– Poole
- 1988
|
|
298
|
Logic programs with classical negation
– Gelfond, Lifschitz
- 1990
|
|
173
|
Abduction compared with negation by failure
– Eshghi, Kowalski
- 1989
|
|
122
|
Well founded semantics for logic programs with explicit negation. in ECAI'92
– Pereira, Alferes
- 1992
|
|
122
|
Every logic program has a natural stratification and an iterated least fixed point model
– Przymusinski
- 1989
|
|
95
|
Extended stable semantics for normal and disjunctive logic programs
– Przymusinski
- 1990
|
|
82
|
Logic Programs with Exceptions
– Kowalski, Sadri
- 1990
|
|
62
|
On the theory of inconsistent formal systems
– Costa
- 1974
|
|
61
|
Paraconsistent logic programming
– Blair, Subrahmanian
- 1989
|
|
53
|
On logic program semantics with two kinds of negation
– Alferes, Pereira
- 1992
|
|
52
|
Aparicio Contradiction Removal within the Well Founded Semantics. Logic Programming and Non-monotonic Reasoning Workshop
– Pereira, Alferes, et al.
- 1991
|
|
50
|
Problems and promises of computational logic
– KOWALSKI
- 1990
|
|
44
|
Alferes. Diagnosis and debugging as contradiction removal
– Pereira, Dam'asio, et al.
- 1993
|
|
44
|
Alferes. Nonmonotonic reasoning with well founded semantics
– Pereira, Apar'icio, et al.
- 1991
|
|
42
|
A database needs two kinds of negation
– Wagner
- 1991
|
|
39
|
A goal-oriented approach to computing well founded semantics
– Chen, Warren
- 1992
|
|
29
|
Derivation procedures for extended stable models
– Pereira, Apar'icio, et al.
- 1991
|
|
29
|
Extended logic programs with default assumptions
– Inoue
- 1991
|
|
27
|
Reasoning with negative information I: Strong negation in logic programs
– Pearce, Wagner
- 1990
|
|
24
|
Alferes. Counterfactual reasoning based on revising assumptions
– Pereira, Apar'icio, et al.
- 1991
|
|
22
|
Prolegomena to Logic Programming for Non-Monotonic Reasoning. Nonmonotonic Extensions of Logic Programming
– Dix, Pereira, et al.
- 1997
|
|
20
|
Reasoning with Inconsistency in Extended Deductive Databases
– Wagner
- 1993
|
|
16
|
A framework for Prolog debugging
– Pereira, Calejo
- 1988
|
|
14
|
The XWAM: A Machine That Integrates Prolog and Deductive Database Query Evaluation
– Warren
- 1989
|
|
14
|
Extended well--founded semantics for paraconsistent logic programs
– Sakama
- 1992
|
|
12
|
Alferes. Contradiction: when avoidance equal removal
– Pereira, J
- 1993
|
|
12
|
Contradiction removal semantics with explicit negation
– Pereira, Alferes, et al.
- 1992
|
|
12
|
An abductive framework for general logic programs and other nonmonotonic systems
– Brewka, Konolige
- 1993
|
|
12
|
Using default and causal reasoning in diagnosis
– Konolige
- 1994
|
|
11
|
Scenario semantics of extended logic programs
– Alferes, Dung, et al.
- 1993
|
|
10
|
Alferes. Semantics of Logic Programs with Explicit Negation
– J'ulio
- 1993
|
|
10
|
Negation as hypotheses: An abductive framework for logic programming
– Dung
- 1991
|
|
10
|
Optative reasoning with scenario semantics
– Pereira, Alferes
- 1993
|
|
7
|
The Extended Stable Models of Contradiction Removal Semantics
– Pereira, Alferes, et al.
- 1991
|
|
5
|
A nonmonotonic reasoning formalism using implicit specificity information
– Geerts, Vermeir
- 1993
|
|
