Paraconsistent Circumscription: First-Order Case

Authors:
Affiliations:
Venue:
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Year:
1995

Citing 8
Cited 0

Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
On the satisfiability of circumscription

Artificial Intelligence
Readings in nonmonotonic reasoning

Readings in nonmonotonic reasoning
Reasoning about truth (research note)

Artificial Intelligence
Logics for inheritance theory

Proceedings of the 2nd international workshop on Non-monotonic reasoning
A Note on Tableaux of Logic of Paradox

KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Nonmonotonic logics: meaning and utility

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In this paper we describe paraconsistent circumscription by application of predicate circumscription in a paraconsistent logic. In addition to circumscribe the predicates, we also circumscribe the inconsistency. Paraconsistent circumscription can be well characterized by the minimal semantics that is both nonmonotonic and paraconsistent. It brings us advantages at least in two respects: nonmonotonic logic would be nontrivial while there was a contradiction, and paraconsistent logic would be equivalent to classical logic while there was no direct effect of a contradiction.