Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations

@inproceedings{Arieli1999NonmonotonicAP,
  title={Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations},
  author={Ofer Arieli and Arnon Avron},
  booktitle={ESCQARU},
  year={1999}
}
In this paper we develop frameworks for logical systems which are able to reflect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson. Our sequence of frameworks culminates in what we call plausible, nonmonotonic, multiple-conclusion consequence relations (which are based on a given monotonic one). Our study yields intuitive justifications for… 
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations
TLDR
A sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson are considered, which allow the use of monotonic nonclassical logics as the underlying logic upon which nonmonotonic reasoning may be based.
Unifying logics via context-sensitiveness
TLDR
The cut-elimination theorem is proved for a version of controlled propositional classical logic, i.e. the sequent calculus for classical propositional logic to which a suitable system of control sets is applied.
Reasoning with different levels of uncertainty
  • O. Arieli
  • Computer Science
    J. Appl. Non Class. Logics
  • 2003
TLDR
A family of preferential logics that are useful for handling information with different levels of uncertainty are introduced, and it is shown that the formalisms in this family can be embedded in corresponding four-valued logics with at most three uncertainty levels.
Minimally inconsistent reasoning in Semantic Web
TLDR
This paper presents a non-monotonic paraconsistent version of description logic reasoning, called minimally inconsistent reasoning, where inconsistencies tolerated in the reasoning are minimized so that more reasonable conclusions can be inferred.
Preferential Logics for Reasoning with Graded Uncertainty
TLDR
A family of preferential logics that are useful for handling information with different levels of uncertainty are introduced and any formalism in this family that is based on a well-founded ordering of the different types of uncertainty, can be embedded in a corresponding four-valued logic with at most three uncertainty levels.
Reasoning with Modularly Pointwise Preferential Relations
TLDR
A family of preferential consequence relations is introduced, deened by a simple and natural many-valued semantics, that share many desirable properties for common-sense reasoning, such as paraconsistency.
Useful adaptive logics for rational and paraconsistent reasoning
TLDR
A family of logics that are particularly useful for reasoning with uncertainty are introduced, which are nonmonotonic, para-consistent, adaptive in the sense of Batens, plausibility logics in thesense of Lehmann, and rational in the Sense of Lehman and Magidor.

References

SHOWING 1-10 OF 24 REFERENCES
Reasoning with logical bilattices
TLDR
This paper develops proof systems, which correspond to bilattice in an essential way, and introduces the notion of logical bilattices, which can be used for efficient inferences from possibly inconsistent data.
Minimally inconsistent LP
The paper explains how a paraconsistent logician can appropriate all classical reasoning. This is to take consistency as a default assumption, and hence to work within those models of the theory at
Nonmonotonic Logics and Semantics
TLDR
A more general semantics is described in this paper, based on a set of natural properties of choice functions, which is shown to be equivalent to a semantics based on comparing the relative "importance" of sets of models, by what amounts to a qualitative probability measure.
The Value of the Four Values
Rules and Derived Rules
TLDR
The purpose of the present paper is to supply the details along with some general definitions about rules and derivations for derivations of axioms and theorems from arithmetic.
On Closed World Data Bases
  • R. Reiter
  • Computer Science
    Logic and Data Bases
  • 1977
TLDR
This paper shows that closed world evaluation of an arbitrary query may be reduced to open world evaluated of so-called atomic queries, and shows that the closed world assumption can lead to inconsistencies, but for Horn data bases no such inconsistencies can arise.
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems
  • D. Gabbay
  • Computer Science
    Logics and Models of Concurrent Systems
  • 1984
TLDR
Inference mechanism to extract more information out of P, a set of propositions of predicate logic, which is a collection of confirmed data items.
...
...