Ofer Arieli

TL;DR: This paper develops efficient approximate methods for query answering, based on fixpoint computations, and investigates conditions that assure the optimality of these methods.

TL;DR: It is shown that decisive conclusions of such a process correspond to well-accepted consequences of the underlying argumentation framework, and the outcome is a general and modular proof-theoretical approach for paraconsistent and non-monotonic reasoning with argumentation systems.

TL;DR: A four-valued approach for recovering consistent data from inconsistent set of assertions for a common family of knowledge-bases is presented and an efficient algorithm for doing so automaticly is provided.

TL;DR: Unless the falsity propositional constant is part of the defeasible assumptions, the grounded and the well-founded semantics for ABFs lack most of the desirable properties they have in abstract argumentation frameworks (AAFs), and for simple definitions of the contrariness operator and the attacks relations, preferred and stable semantics are reduced to naive semantics.

TL;DR: 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.