Order:
Disambiguations
Ofer Arieli [31]O. Arieli [2]
  1.  68
    Reasoning with logical bilattices.Ofer Arieli & Arnon Avron - 1996 - 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 (3 more)  
     
    Export citation  
     
    Bookmark   112 citations  
  2.  14
    The value of the four values.Ofer Arieli & Arnon Avron - 1998 - Artificial Intelligence 102 (1):97-141.
  3.  40
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  4. 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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  5.  49
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  6.  53
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  7.  68
    Logical argumentation by dynamic proof systems.Ofer Arieli & Christian Straßer - forthcoming - Theoretical Computer Science.
    In this paper we provide a proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi. The idea is to imitate argumentative movements in which certain claims are introduced or withdrawn in the presence of counter-claims. This is done by a dynamic evaluation of sequences of sequents, in which the latter are considered ‘derived’ or ‘not derived’ according (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  16
    Reasoning with maximal consistency by argumentative approaches.Ofer Arieli, AnneMarie Borg & Christian Straßer - 2018 - Journal of Logic and Computation 28 (7):1523--1563.
    Reasoning with the maximally consistent subsets of the premises is a well-known approach for handling contradictory information. In this paper we consider several variations of this kind of reasoning, for each one we introduce two complementary computational methods that are based on logical argumentation theory. The difference between the two approaches is in their ways of making consequences: one approach is of a declarative nature and is related to Dung-style semantics for abstract argumentation, while the other approach has a more (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  54
    A QBF-based formalization of abstract argumentation semantics.Ofer Arieli & Martin W. A. Caminada - 2013 - Journal of Applied Logic 11 (2):229-252.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  10.  6
    Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks.Ofer Arieli - 2015 - Journal of Applied Logic 13 (4):582-604.
  11.  19
    Normative reasoning by sequent-based argumentation.Christian Straßer & Ofer Arieli - 2015 - Journal of Logic and Computation 29 (3):387-415.
    In this article, we present an argumentative approach to normative reasoning. Special attention is paid to deontic conflicts, contrary-to-duty and specificity cases, which are modelled by means of argumentative attacks. For this, we adopt a recently proposed framework for logical argumentation in which arguments are generated by a sequent calculus of a given base logic of Argument & Computation ), and use standard deontic logic as our base logic. Argumentative attacks are realized by elimination rules that allow to discharge specific (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  12.  51
    General patterns for nonmonotonic reasoning: from basic entailments to plausible relations.O. Arieli & A. Avron - 2000 - 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  
     
    Bookmark   8 citations  
  13.  18
    A Generalized Proof-Theoretic Approach to Logical Argumentation Based on Hypersequents.AnneMarie Borg, Christian Straßer & Ofer Arieli - 2020 - Studia Logica 109 (1):167-238.
    In this paper we introduce hypersequent-based frameworks for the modelling of defeasible reasoning by means of logic-based argumentation and the induced entailment relations. These structures are an extension of sequent-based argumentation frameworks, in which arguments and the attack relations among them are expressed not only by Gentzen-style sequents, but by more general expressions, called hypersequents. This generalization allows us to overcome some of the known weaknesses of logical argumentation frameworks and to prove several desirable properties of the entailments that are (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  23
    Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming.Jesse Heyninck, Ofer Arieli & Bart Bogaerts - 2024 - Artificial Intelligence 331 (C):104110.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Prioritized sequent-based argumentation.Ofer Arieli, AnneMarie Borg & Christian Straßer - 2018 - In Elisabeth Andre & Sven Koening (eds.), Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems. pp. 1105--1113.
  16.  12
    Hypersequent-Based Argumentation: An Instantiation in the Relevance Logic RM.AnneMarie Borg, Ofer Arieli & Christian Straßer - 2018 - In E. Black, S. Modgil & N. Oren (eds.), Theory and Applications of Formal Argumentation. TAFA 2017. Lecture Notes in Computer Science, vol 10757. Springer. pp. 17–34.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  6
    Argumentative Approaches to Reasoning with Consistent Subsets of Premises.Ofer Arieli, AnneMarie Borg & Christian Straßer - 2017 - Lecture Notes in Computer Science:455–465.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  10
    Deductive Argumentation by Enhanced Sequent Calculi and Dynamic Derivations.Ofer Arieli & Christian Straßer - 2016 - Electronic Notes in Theoretical Computer Science 323:21–37.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  16
    Reasoning with prioritized information by iterative aggregation of distance functions.Ofer Arieli - 2008 - Journal of Applied Logic 6 (4):589-605.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  20. Sequent-Based Argumentation for Normative Reasoning.Christian Straßer & Ofer Arieli - 2016 - In Olivier Roy, Allard Tamminga & Malte Willer (eds.), Deontic Logic and Normative Systems. London, UK: College Publications. pp. 224--240.
     
    Export citation  
     
    Bookmark   1 citation  
  21.  24
    A postulate-driven study of logical argumentation.Ofer Arieli, AnneMarie Borg & Christian Straßer - 2023 - Artificial Intelligence 322 (C):103966.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  19
    Dynamic Derivations for Sequent-Based Logical Argumentation.Ofer Arieli & Christian Straßer - 2014 - In Simon Parsons, Nir Oren, Chris Reed & Federico Cerutti (eds.), Proceedings COMMA 2014. IOS Press. pp. 89--100.
  23.  36
    Conflict-tolerant semantics for argumentation frameworks.Ofer Arieli - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 28--40.
  24.  19
    Arnon Avron on Semantics and Proof Theory of Non-Classical Logics.Ofer Arieli & Anna Zamansky (eds.) - 2021 - Springer Verlag.
    This book is a collection of contributions honouring Arnon Avron’s seminal work on the semantics and proof theory of non-classical logics. It includes presentations of advanced work by some of the most esteemed scholars working on semantic and proof-theoretical aspects of computer science logic. Topics in this book include frameworks for paraconsistent reasoning, foundations of relevance logics, analysis and characterizations of modal logics and fuzzy logics, hypersequent calculi and their properties, non-deterministic semantics, algebraic structures for many-valued logics, and representations of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. Argumentative Approaches to Reasoning with Maximal Consistency.Ofer Arieli & Christian Straßer - 2016 - In Chitta Baral, James Delgrande & Frank Wolter (eds.), KR'16: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning. pp. 509--512.
  26.  27
    Preface.Ofer Arieli & Anna Zamansky - 2016 - Logic Journal of the IGPL 24 (3):221-223.
  27. Proceedings of Flairs 2020.Ofer Arieli, AnneMarie Borg & Christian Straßer (eds.) - forthcoming
    No categories
     
    Export citation  
     
    Bookmark  
  28.  76
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  29.  21
    Simplified forms of computerized reasoning with distance semantics.Ofer Arieli & Anna Zamansky - 2011 - Journal of Applied Logic 9 (1):1-22.
  30. Tuning Logical Argumentation Frameworks: A Postulate-Derived Approach.Ofer Arieli, AnneMarie Borg & Christian Straßer - forthcoming - In Ofer Arieli, AnneMarie Borg & Christian Straßer (eds.), Proceedings of Flairs 2020.
    No categories
     
    Export citation  
     
    Bookmark