Switch to: References

Citations of:

Reasoning about truth

Artificial Intelligence 39 (2):231-244 (1989)

Add citations

You must login to add citations.
  1. Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics.Ofer Arieli, Arnon Avron & Anna Zamansky - 2011 - Studia Logica 97 (1):31 - 60.
    Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We show that all reasonable paraconsistent logics based on three-valued deterministic matrices are maximal in our strong sense. This applies to practically all three-valued (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Wittgenstein on Incompleteness Makes Paraconsistent Sense.Francesco Berto - 2013 - In Francesco Berto, Edwin Mares, Koji Tanaka & Francesco Paoli (eds.), Paraconsistency: Logic and Applications. Dordrecht, Netherland: Springer. pp. 257--276.
    I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
    We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, each one of which is not (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Reasoning with different levels of uncertainty.Ofer Arieli - 2003 - Journal of Applied Non-Classical Logics 13 (3):317-343.
    We introduce a family of preferential logics that are useful for handling information with different levels of uncertainty. The corresponding consequence relations are nonmonotonic, paraconsistent, adaptive, and rational. It is also shown that the formalisms in this family can be embedded in corresponding four-valued logics with at most three uncertainty levels, and that reasoning with these logics can be simulated by algorithms for processing circumscriptive theories, such as DLS and SCAN.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sequent-based logical argumentation.Ofer Arieli & Christian Straßer - 2015 - Argument and Computation 6 (1):73-99.
    We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks between arguments are represented by sequent elimination rules, and deductions are made according to Dung-style skeptical or credulous semantics. This framework accommodates different languages and logics in which arguments may be represented, allows for a flexible and simple way of expressing and identifying arguments, supports a variety of attack relations, and is faithful to standard methods of drawing conclusions (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)Handling inconsistency in knowledge systems.Gerd Wagner - 1997 - Journal of Applied Non-Classical Logics 7 (1-2):7-12.
    Download  
     
    Export citation  
     
    Bookmark  
  • Four-Valued Paradefinite Logics.Ofer Arieli & Arnon Avron - 2017 - Studia Logica 105 (6):1087-1122.
    Paradefinite logics are logics that can be used for handling contradictory or partial information. As such, paradefinite logics should be both paraconsistent and paracomplete. In this paper we consider the simplest semantic framework for introducing paradefinite logics. It consists of the four-valued matrices that expand the minimal matrix which is characteristic for first degree entailments: Dunn–Belnap matrix. We survey and study the expressive power and proof theory of the most important logics that can be developed in this framework.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Analysing inconsistent first-order knowledgebases.John Grant & Anthony Hunter - 2008 - Artificial Intelligence 172 (8-9):1064-1093.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Nonmonotonic reasoning based on incomplete logic.Tuan-Fang Fan, I. -Peng Lin & Churn-Jung Liau - 1997 - Journal of Applied Non-Classical Logics 7 (4):375-395.
    ABSTRACT What characterizes human reasoning is the ability of dealing with incomplete information. Incomplete logic is developed for modeling incomplete knowledge. The most distinctive feature of incomplete logic is its semantics. This is an alternative presentation of partial semantics. In this paper, we will introduce the general notion of incomplete logic (ICL), compare it with partial logic, and give the resolution method for it. We will also show how ICL can be applied to nonmonotonic reasoning. We define nonmonotonic derivation as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Finding explanations of inconsistency in multi-context systems.Thomas Eiter, Michael Fink, Peter Schüller & Antonius Weinzierl - 2014 - Artificial Intelligence 216 (C):233-274.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A postulate-driven study of logical argumentation.Ofer Arieli, AnneMarie Borg & Christian Straßer - 2023 - Artificial Intelligence 322 (C):103966.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Quantum Probability Perspective on Borderline Vagueness.Reinhard Blutner, Emmanuel M. Pothos & Peter Bruza - 2013 - Topics in Cognitive Science 5 (4):711-736.
    The term “vagueness” describes a property of natural concepts, which normally have fuzzy boundaries, admit borderline cases, and are susceptible to Zeno's sorites paradox. We will discuss the psychology of vagueness, especially experiments investigating the judgment of borderline cases and contradictions. In the theoretical part, we will propose a probabilistic model that describes the quantitative characteristics of the experimental finding and extends Alxatib's and Pelletier's () theoretical analysis. The model is based on a Hopfield network for predicting truth values. Powerful (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • The value of the four values.Ofer Arieli & Arnon Avron - 1998 - Artificial Intelligence 102 (1):97-141.
    Download  
     
    Export citation  
     
    Bookmark   55 citations