![]() Gabbay, Dov M. ![]() in Review of Symbolic Logic (2009), 2(2), 396404 Detailed reference viewed: 31 (1 UL)![]() ![]() Gabbay, Dov M. ![]() in HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM LOGIC (2009) Detailed reference viewed: 109 (0 UL)![]() ; ; Gabbay, Dov M. ![]() Book published by Springer (2009) Detailed reference viewed: 97 (0 UL)![]() Caminada, Martin ![]() ![]() in Studia Logica (2009) In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able ... [more ▼] In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment. [less ▲] Detailed reference viewed: 161 (4 UL)![]() Gabbay, Dov M. ![]() in Studia Logica (2009) A reactive graph generalizes the concept of a graph by making it dynamic, in the sense that the arrows coming out from a point depend on how we got there. This idea was fi rst applied to Kripke semantics ... [more ▼] A reactive graph generalizes the concept of a graph by making it dynamic, in the sense that the arrows coming out from a point depend on how we got there. This idea was fi rst applied to Kripke semantics of modal logic in [2]. In this paper we strengthen that unimodal language by adding a second operator. One op- erator corresponds to the dynamics relation and the other one relates paths with the same endpoint. We explore the expressivity of this interpretation by axiomatizing some natural subclasses of reactive frames. The main objective of this paper is to present a methodology to study reactive logics using the existent classic techniques. [less ▲] Detailed reference viewed: 109 (0 UL)![]() Gabbay, Dov M. ![]() in Studia Logica (2009), 92(3), 365379 Detailed reference viewed: 30 (0 UL)![]() Gabbay, Dov M. ![]() Book published by Springer (2009) Detailed reference viewed: 72 (0 UL)![]() Gabbay, Dov M. ![]() in Studia Logica (2009) Detailed reference viewed: 33 (0 UL)![]() Gabbay, Dov M. ![]() in Studia Logica (2009) This paper studies methodologically robust options for giving logical contents to nodes in abstract argumentation networks. It defines a variety of notions of attack in terms of the logical contents of ... [more ▼] This paper studies methodologically robust options for giving logical contents to nodes in abstract argumentation networks. It defines a variety of notions of attack in terms of the logical contents of the nodes in a network. General properties of logics are refined both in the object level and in the meta level to suit the needs of the application. The network-based system improves upon some of the attempts in the literature to define attacks in terms of defeasible proofs, the so-called rule- based systems. We also provide a number of examples and consider a rigorous case study, which indicate that our system does not suffer from anomalies. We define consequence relations based on a notion of defeat, consider rationality postulates, and prove that one such consequence relation is consistent. [less ▲] Detailed reference viewed: 88 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Studia Logica (2009) In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an ... [more ▼] In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung’s basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung’s theory of abstract argumentation to itself, by instantiating Dung’s abstract arguments with meta-arguments using a technique called flattening. We characterize the domain of instantiation using a representation technique based on soundness and completeness. Finally, we distinguish among various instantiations using the technique of specification languages. [less ▲] Detailed reference viewed: 51 (0 UL)![]() Gabbay, Dov M. ![]() in Journal of Logic and Computation (2008), 16(6), 499536 Detailed reference viewed: 116 (1 UL)![]() Gabbay, Dov M. ![]() Book published by College publications (2008) Detailed reference viewed: 20 (0 UL)![]() Gabbay, Dov M. ![]() ![]() ![]() Book published by Springer-Verlag (2008) Detailed reference viewed: 39 (0 UL)![]() ; ; Gabbay, Dov M. ![]() Book published by Springer (2008) Detailed reference viewed: 82 (0 UL)![]() Gabbay, Dov M. ![]() Book published by College publications (2008) Detailed reference viewed: 105 (0 UL)![]() Gabbay, Dov M. ![]() in Review of Symbolic Logic (2008), 1(03), 267304 For nonmonotonic logics, Cumulativity is an important logical rule. We show here that Cumulativity fans out into an infinity of different conditions, if the domain is not closed under finite unions. Detailed reference viewed: 87 (1 UL)![]() ![]() Grossi, Davide ![]() ![]() ![]() in Proceedings of the 3rd International Workshop on Normative Multiagent Systems (NorMAS'08) (2008) Detailed reference viewed: 55 (1 UL)![]() Gabbay, Dov M. ![]() in Review of Symbolic Logic (2008), 1(03), 267304 Detailed reference viewed: 48 (2 UL)![]() Gabbay, Dov M. ![]() in Studia Logica (2008), 88(1), 85112 Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions ∆ to conclusions C without their being any deductive chain from ∆ ... [more ▼] Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions ∆ to conclusions C without their being any deductive chain from ∆ to C. Such jumps are done by various mechanisms which are strongly dependent on context and knowledge of how the actual world functions. Our aim is to motivate these jump rules as inference rules designed to optimise survival in an environment with scant resources of effort and time. We begin with a general discussion and quickly move to Section 3 where we introduce five resource principles. We show that these principles lead to some well known nonmonotonic systems such as Nute’s defeasible logic. We also give several examples of practical reasoning situations to illustrate our principles. [less ▲] Detailed reference viewed: 123 (1 UL)![]() ![]() Gabbay, Dov M. ![]() in Handbook of Philosophical Logic (2008) Detailed reference viewed: 19 (1 UL) |
||