Semantics of Normal Logic Programs and Contested Information

Authors:
Shekhar Pradhan
Affiliations:
-
Venue:
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Year:
1996

Citing 6
Cited 1

Paraconsistent logic programming

Theoretical Computer Science
RI: A logic for reasoning with inconsistency

Proceedings of the Fourth Annual Symposium on Logic in computer science
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics

Logic programming
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Combining databases with prioritized information

Journal of Intelligent Information Systems
Reasoning in Inconsistent Knowledge Bases

IEEE Transactions on Knowledge and Data Engineering

Connecting databases with argumentation

INAP'01 Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose C4, a four-valued semantics for normal, logic programs. Using this semantics, we define two types of entailment: strong and weak. We show that a normal, logic program strongly entails a sentence under C4 if, and only if, the program entails that sentence under the well founded semantics and it weakly entails a sentence if, and only if, the program entails that sentence under the two-valued stable model semantics. We argue that this shows that the difference between the well founded semantics and the stable model semantics can be characterized in terms of their attitude to what we call contested information. We use this insight to propose a general theory of contested reasoning.