12 found
Order:
Disambiguations:
Ofer Arieli [11]O. Arieli [2]
  1.  20
    Ofer Arieli & Arnon Avron (1996). Reasoning with Logical Bilattices. Journal of Logic, Language and Information 5 (1):25--63.
    The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   32 citations  
  2.  31
    O. Arieli, A. Avron & A. Zamansky (2011). Ideal Paraconsistent Logics. 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 (...)
    Translate
      Direct download (7 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  3.  7
    Ofer Arieli, Arnon Avron & Anna Zamansky (2011). Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics. 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  4.  1
    Ofer Arieli & Martin W. A. Caminada (2013). A QBF-Based Formalization of Abstract Argumentation Semantics. Journal of Applied Logic 11 (2):229-252.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  20
    Ofer Arieli (2003). Reasoning with Different Levels of Uncertainty. Journal of Applied Non-Classical Logics 13 (3-4):317-343.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  6.  1
    Ofer Arieli (2008). Reasoning with Prioritized Information by Iterative Aggregation of Distance Functions. Journal of Applied Logic 6 (4):589-605.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  7.  1
    Ofer Arieli & Anna Zamansky (2016). Preface. Logic Journal of the IGPL 24 (3):221-223.
    Direct download  
     
    Export citation  
     
    My bibliography  
  8.  9
    Ofer Arieli (2012). Conflict-Tolerant Semantics for Argumentation Frameworks. In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer 28--40.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9.  8
    Ofer Arieli & Christian Straßer (2015). Sequent-Based Logical Argumentation. 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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  10.  1
    Ofer Arieli & Anna Zamansky (2011). Simplified Forms of Computerized Reasoning with Distance Semantics. Journal of Applied Logic 9 (1):1-22.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  11.  7
    O. Arieli & A. Avron (2000). General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations. Logic Journal of the IGPL 8 (2):119-148.
    This paper has two goals. First, we develop frameworks for logical systems which are able to reflect not only non-monotonic patterns of reasoning, but also paraconsistent reasoning. Our second goal is to have a better understanding of the conditions that a useful relation for nonmonotonic reasoning should satisfy. For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson. These generalizations allow the use of monotonic nonclassical logics as the underlying logic upon (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Ofer Arieli (2015). Conflict-Free and Conflict-Tolerant Semantics for Constrained Argumentation Frameworks. Journal of Applied Logic 13 (4):582-604.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography