This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new fixpoint semantics of extended disjunctive programs. Applications of the paraconsistent semantics for reasoning in inconsistent programs are also presented.
|
1126
|
The Stable Model Semantics for Logic Programming
– Gelfond, Lifschitz
- 1988
|
|
615
|
The semantics of Predicate Logic as a Programming Language
– Emden, Kowalski
- 1976
|
|
554
|
Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365–385
– Gelfond, Lifschitz
- 1991
|
|
325
|
Bilattices and the semantics of logic programming
– Fitting
- 1991
|
|
221
|
A useful four-valued logic
– Belnap
- 1977
|
|
142
|
Stable semantics for disjunctive programs
– PRZYMUSINSKI
- 1991
|
|
96
|
Combining knowledge bases consisting of first-order theories
– Baral, Kraus, et al.
|
|
91
|
A logic for reasoning with inconsistency
– Kifer, EL
- 1992
|
|
82
|
Logic Programs with Exceptions
– Kowalski, Sadri
- 1990
|
|
79
|
On indefinite data bases and the closed world assumption
– Minker
- 1982
|
|
62
|
On the theory of inconsistent formal systems
– Costa
- 1974
|
|
61
|
Paraconsistent logic programming
– Blair, Subrahmanian
- 1989
|
|
55
|
A fixpoint semantics for disjunctive logic programs
– Minker, Rajasekar
- 1990
|
|
54
|
Stable and extension class theory for logic programs and default logics
– Baral, Subrahmanian
- 1992
|
|
52
|
The family of stable models
– Fitting
- 1993
|
|
52
|
Embedding Negation as Failure into a Model Generation Theorem Prover
– Inoue, Koshimura, et al.
- 1992
|
|
52
|
Aparicio Contradiction Removal within the Well Founded Semantics. Logic Programming and Non-monotonic Reasoning Workshop
– Pereira, Alferes, et al.
- 1991
|
|
42
|
A database needs two kinds of negation
– Wagner
- 1991
|
|
41
|
Possible Model Semantics for Disjunctive Databases
– Sakama
- 1990
|
|
37
|
Multi-valued Logics
– Ginsberg
- 1986
|
|
34
|
A fixpoint semantics for general logic programs compared with the well–supported and stable model semantics
– Fages
- 1991
|
|
29
|
Extended logic programs with default assumptions
– Inoue
- 1991
|
|
27
|
A possible world semantics for disjunctive databases
– Chan
- 1993
|
|
27
|
Well-founded reasoning with classical negation
– Dung, Ruamviboonsuk
- 1991
|
|
23
|
Transforming abductive logic programs to disjunctive programs
– moue, Sakama
- 1993
|
|
20
|
Reasoning with Inconsistency in Extended Deductive Databases
– Wagner
- 1993
|
|
16
|
Disjunctive LP + integrity constraints = stable model semantics
– Fernandez, Lobo, et al.
- 1993
|
|
14
|
Extended well--founded semantics for paraconsistent logic programs
– Sakama
- 1992
|
|
13
|
A survey of paraconsistent logic
– Arruda
- 1980
|
|
13
|
Paraconsistent disjunctive deductive databases
– Subrahmanian
- 1992
|
|
11
|
Belief Revision and Paraconsistency in a Logic Programming Framework
– Pimentel, Rodi
- 1991
|
|
10
|
Negation in disjunctive logic programs
– Sakama, Inoue
- 1993
|
|
8
|
Reasoning in inconsistent knowledge bases
– Grant, Subrahmanian
- 1995
|
|
4
|
A characterization of stable models using a non-monotonic operator
– Teusink
- 1993
|
|
1
|
The closed world assumption in paraconsistent deductive databases
– Lu, Henschen
- 1992
|
