160 found
Sort by:
See also:
Profile: Dov Gabbay
  1. Dov M. Gabbay & John Woods, Advice on Abductive Logic.
    One of our purposes here is to expose something of the elementary logical structure of abductive reasoning, and to do so in a way that helps orient theorists to the various tasks that a logic of abduction should concern itself with. We are mindful of criticisms that have been levelled against the very idea of a logic of abduction; so we think it prudent to proceed with a certain diffidence. That our own account of abduction is itself abductive is methodological (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Jon Williamson & D. M. Gabbay, Recursive Causality in Bayesian Networks and Self-Fibring Networks.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. M. de Boer, D. Gabbay, X. Parent & M. Slavkova (forthcoming). Two Dimensional Deontic Logic. Synthese.
    No categories
     
    My bibliography  
     
    Export citation  
  4. D. M. Gabbay (forthcoming). A Tense Logic with Split Truth Table. Logique Et Analyse.
    No categories
     
    My bibliography  
     
    Export citation  
  5. D. Gabbay & F. Pirri (forthcoming). Special Issue on Combining Logics, Volume 59 (1, 2) Of. Studia Logica.
     
    My bibliography  
     
    Export citation  
  6. Dov Gabbay, Stephan Hartmann & John Woods (eds.) (forthcoming). Handbook of the History and Philosophy of Logic, Vol. 10: Inductive Logic. Elsevier.
  7. M. Abraham, D. M. Gabbay & U. Schild (2012). Contrary to Time Conditionals in Talmudic Logic. Artificial Intelligence and Law 20 (2):145-179.
    We consider conditionals of the form A ⇒ B where A depends on the future and B on the present and past. We examine models for such conditional arising in Talmudic legal cases. We call such conditionals contrary to time conditionals.Three main aspects will be investigated: Inverse causality from future to past, where a future condition can influence a legal event in the past (this is a man made causality).Comparison with similar features in modern law.New types of temporal logics arising (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. H. Barringer, D. M. Gabbay & J. Woods (2012). Modal and Temporal Argumentation Networks. Argument and Computation 3 (2-3):203 - 227.
    The traditional Dung networks depict arguments as atomic and study the relationships of attack between them. This can be generalised in two ways. One is to consider various forms of attack, support, feedback, etc. Another is to add content to nodes and put there not just atomic arguments but more structure, e.g. proofs in some logic or simply just formulas from a richer language. This paper offers to use temporal and modal language formulas to represent arguments in the nodes of (...)
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. H. Barringer, D. M. Gabbay & J. Woods (2012). Temporal, Numerical and Meta-Level Dynamics in Argumentation Networks. Argument and Computation 3 (2-3):143 - 202.
    This paper studies general numerical networks with support and attack. Our starting point is argumentation networks with the Caminada labelling of three values 1=in, 0=out and ½=undecided. This is generalised to arbitrary values in [01], which enables us to compare with other numerical networks such as predator?prey ecological networks, flow networks, logical modal networks and more. This new point of view allows us to see the place of argumentation networks in the overall landscape of networks and import and export ideas (...)
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Alexander Bochman & Dov M. Gabbay (2012). Sequential Dynamic Logic. Journal of Logic, Language and Information 21 (3):279-298.
    We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  11. Mathijs Boer, Dov M. Gabbay, Xavier Parent & Marija Slavkovic (2012). Two Dimensional Standard Deontic Logic [Including a Detailed Analysis of the 1985 Jones–Pörn Deontic Logic System]. Synthese 187 (2):623-660.
    This paper offers a two dimensional variation of Standard Deontic Logic SDL, which we call 2SDL. Using 2SDL we can show that we can overcome many of the difficulties that SDL has in representing linguistic sets of Contrary-to-Duties (known as paradoxes) including the Chisholm, Ross, Good Samaritan and Forrester paradoxes. We note that many dimensional logics have been around since 1947, and so 2SDL could have been presented already in the 1970s. Better late than never! As a detailed case study (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Mathijs de Boer, Dov M. Gabbay, Xavier Parent & Marija Slavkovic (2012). Two Dimensional Standard Deontic Logic [Including a Detailed Analysis of the 1985 Jones–Pörn Deontic Logic System]. Synthese 187 (2):623-660.
    This paper offers a two dimensional variation of Standard Deontic Logic SDL, which we call 2SDL. Using 2SDL we can show that we can overcome many of the difficulties that SDL has in representing linguistic sets of Contrary-to-Duties (known as paradoxes) including the Chisholm, Ross, Good Samaritan and Forrester paradoxes. We note that many dimensional logics have been around since 1947, and so 2SDL could have been presented already in the 1970s. Better late than never! As a detailed case study (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. D. M. Gabbay (2012). Equational Approach to Argumentation Networks. Argument and Computation 3 (2-3):87 - 142.
    This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the ?extensions? of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, and much more. The equational approach has its conceptual roots in the nineteenth (...)
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. D. M. Gabbay & U. Reyle (2012). Computation with Run Time Skolemisation (N-Prolog Part 3). Journal of Applied Non-Classical Logics 3 (1):93-128.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Uskali Mäki, Dov M. Gabbay, Paul Thagard & John Woods (eds.) (2012). Philosophy of Economics. North Holland.
    This volume serves as a detailed introduction for those new to the field as well as a rich source of new insights and potential research agendas for those already engaged with the philosophy of economics.
    Direct download  
     
    My bibliography  
     
    Export citation  
  16. M. Abraham, D. M. Gabbay & U. Schild (2011). Obligations and Prohibitions in Talmudic Deontic Logic. Artificial Intelligence and Law 19 (2-3):117-148.
    This paper examines the deontic logic of the Talmud. We shall find, by looking at examples, that at first approximation we need deontic logic with several connectives: O T A Talmudic obligation F T A Talmudic prohibition F D A Standard deontic prohibition O D A Standard deontic obligation. In classical logic one would have expected that deontic obligation O D is definable by $O_DA \equiv F_D\neg A$ and that O T and F T are connected by $O_TA \equiv F_T\neg (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Michael Abraham, Dov M. Gabbay, Gabriel Hazut, Yosef E. Maruvka & Uri Schild (2011). Logical Analysis of the Talmudic Rules of General and Specific (Klalim-U-Pratim). History and Philosophy of Logic 32 (1):47-62.
    This article deals with a set-theoretic interpretation of the Talmudic rules of General and Specific, known as Klal and Prat (KP), Prat and Klal (PK), Klal and Prat and Klal (KPK) and Prat and Klal and Prat (PKP).
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  18. D. M. Gabbay (2011). Reactive Intuitionistic Tableaux. Synthese 179 (2):253 - 269.
    We introduce reactive Kripke models for intuitionistic logic and show that the reactive semantics is stronger than the ordinary semantics. We develop Beth tableaux for the reactive semantics.
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  19. Dov M. Gabbay (2011). Dung's Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce–Quine Dagger. Logica Universalis 5 (2):255-318.
    In this paper we show that some versions of Dung’s abstract argumentation frames are equivalent to classical propositional logic. In fact, Dung’s attack relation is none other than the generalised Peirce–Quine dagger connective of classical logic which can generate the other connectives ${\neg, \wedge, \vee, \to}$ of classical logic. After establishing the above correspondence we offer variations of the Dung argumentation frames in parallel to variations of classical logic, such as resource logics, predicate logic, etc., etc., and create resource argumentation (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  20. Dov M. Gabbay & Moshe Koppel (2011). Uncertainty Rules in Talmudic Reasoning. History and Philosophy of Logic 32 (1):63-69.
    The Babylonian Talmud, compiled from the 2nd to 7th centuries C.E., is the primary source for all subsequent Jewish laws. It is not written in apodeictic style, but rather as a discursive record of (real or imagined) legal (and other) arguments crossing a wide range of technical topics. Thus, it is not a simple matter to infer general methodological principles underlying the Talmudic approach to legal reasoning. Nevertheless, in this article, we propose a general principle that we believe helps to (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  21. D. Gabbay (2010). Sampling Logic and Argumentation. Journal of the Indian Council of Philosophical Research 28 (2):233-255.
    No categories
     
    My bibliography  
     
    Export citation  
  22. Dov M. Gabbay & Karl Schlechta (2010). A Comment on Work by Booth and Co-Authors. Studia Logica 94 (3):403 - 432.
    Booth and his co-authors have shown in [2], that many new approaches to theory revision (with fixed K ) can be represented by two relations, , where is a sub-relation of < . They have, however, left open a characterization of the infinite case, which we treat here.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Dov M. Gabbay & Karl Schlechta (2010). A Theory of Hierarchical Consequence and Conditionals. Journal of Logic, Language and Information 19 (1):3-32.
    We introduce -ranked preferential structures and combine them with an accessibility relation. -ranked preferential structures are intermediate between simple preferential structures and ranked structures. The additional accessibility relation allows us to consider only parts of the overall -ranked structure. This framework allows us to formalize contrary to duty obligations, and other pictures where we have a hierarchy of situations, and maybe not all are accessible to all possible worlds. Representation results are proved.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  24. Dov M. Gabbay & Karl Schlechta (2010). Semantic Interpolation. Journal of Applied Non-Classical Logics 20 (4):345-371.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  25. M. Abraham, Dov M. Gabbay & U. Schild (2009). Analysis of the Talmudic Argumentum a Fortiori Inference Rule (Kal Vachomer) Using Matrix Abduction. Studia Logica 92 (3):281 - 364.
    We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix with entries in {0, 1}, we allow for one or more blank squares in the matrix, say a i , j =?. The method allows us to decide whether to declare a i , j = 0 or a i , j = 1 (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  26. Steve Barker, Guido Boella, Dov M. Gabbay & Valerio Genovese (2009). A Meta-Model of Access Control in a Fibred Security Language. Studia Logica 92 (3):437 - 477.
    The issue of representing access control requirements continues to demand significant attention. The focus of researchers has traditionally been on developing particular access control models and policy specification languages for particular applications. However, this approach has resulted in an unnecessary surfeit of models and languages. In contrast, we describe a general access control model and a logic-based specification language from which both existing and novel access control models may be derived as particular cases and from which several approaches can be (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  27. G. Boella, D. M. Gabbay, L. van der Torre & S. Villata (2009). Argumentation Modelling of the Toulmin Scheme. Studia Logica 93 (2-3):297-354.
     
    My bibliography  
     
    Export citation  
  28. Guido Boella, Dov M. Gabbay, Valerio Genovese & Leendert Van Der Torre (2009). Fibred Security Language. Studia Logica 92 (3):395 - 436.
    We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language (both for classical and intuitionistic fragment), we then prove that in order (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  29. Guido Boella, Dov M. Gabbay, Valerio Genovese & Leendert van der Torre (2009). Fibred Security Language. Studia Logica 92 (3):395-436.
    We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language both for classical and intuitionistic fragment), we then prove that in order (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. Guido Boella, Dov M. Gabbay, Leendert van der Torre & Serena Villata (2009). Meta-Argumentation Modelling I: Methodology and Techniques. Studia Logica 93 (2/3):297 - 355.
    In this paper, we introduce the methodology and techniques of metaargumentation 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. (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Guido Boella, Dov M. Gabbay, Leendert van der Torre & Serena Villata (2009). Meta-Argumentation Modelling I: Methodology and Techniques. [REVIEW] Studia Logica 93 (2-3):297-355.
    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. (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Martin W. A. Caminada & Dov M. Gabbay (2009). A Logical Account of Formal Argumentation. Studia Logica 93 (2/3):109 - 145.
    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.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  33. D. M. Gabbay & A. Szalas (2009). Second-Order Quantifier Elimination, Logic Programming and Argumentation Networks. Studia Logica 93 (2-3):147-180.
     
    My bibliography  
     
    Export citation  
  34. Dov Gabbay (ed.) (2009). The Handbook of the History of Logic. Elsevier.
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  35. Dov M. Gabbay (2009). Fibring Argumentation Frames. Studia Logica 93 (2/3):231 - 295.
    This paper is part of a research program centered around argumentation networks and offering several research directions for argumentation networks, with a view of using such networks for integrating logics and network reasoning. In Section 1 we introduce our program manifesto. In Section 2 we motivate and show how to substitute one argumentation network as a node in another argumentation network. Substitution is a purely logical operation and doing it for networks, besides developing their theory further, also helps us see (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  36. Dov M. Gabbay (2009). Modal Provability Foundations for Argumentation Networks. Studia Logica 93 (2/3):181 - 198.
    Given an argumentation network we associate with it a modal formula representing the 'logical content' of the network. We show a one-to-one correspondence between all possible complete Caminada labellings of the network and all possible models of the formula.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  37. Dov M. Gabbay (2009). Semantics for Higher Level Attacks in Extended Argumentation Frames. Part 1: Overview. Studia Logica 93 (2/3):357 - 381.
    In 2005 the author introduced networks which allow attacks on attacks of any level. So if a → b reads a attacks 6, then this attack can itself be attacked by another node c. This attack itself can attack another node d. This situation can be iterated to any level with attacks and nodes attacking other attacks and other nodes. In this paper we provide semantics (of extensions) to such networks. We offer three different approaches to obtaining semantics. 1. The (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  38. Dov M. Gabbay & Artur S. D'Avila Garcez (2009). Logical Modes of Attack in Argumentation Networks. Studia Logica 93 (2-3):199-230.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Dov M. Gabbay & Artur S. D.’Avila Garcez (2009). Logical Modes of Attack in Argumentation Networks. Studia Logica 93 (2/3):199 - 230.
    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 metalevel 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 (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Dov M. Gabbay & Sérgio Marcelino (2009). Modal Logics of Reactive Frames. Studia Logica 93 (2/3):405 - 446.
    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 first applied to Kripke semantics of modal logic in [2]. In this paper we strengthen that unimodal language by adding a second operator. One operator corresponds to the dynamics relation and the other one relates paths with the same endpoint. We explore the expressivity of this interpretation by (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Dov M. Gabbay & Karl Schlechta (2009). Independence — Revision and Defaults. Studia Logica 92 (3):381 - 394.
    We investigate different aspects of independence here, in the context of theory revision, generalizing slightly work by Chopra, Parikh, and Rodrigues, and in the context of preferential reasoning.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  42. Dov M. Gabbay & Karl Schlechta (2009). Roadmap for Preferential Logics. Journal of Applied Non-Classical Logics 19 (1):43-95.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Dov M. Gabbay & Karl Schlechta (2009). Reactive Preferential Structures and Nonmonotonic Consequence. Review of Symbolic Logic 2 (2):414-450.
    We introduce Information Bearing Relation Systems (IBRS) as an abstraction of many logical systems. These are networks with arrows recursively leading to other arrows etc. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very natural way preferential semantics and solves open representation problems for weak logical systems. This is possible, as we can the strong coherence properties of preferential structures by higher arrows, that is, arrows, which do not go (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  44. Dov M. Gabbay & Karl Schlechta (2009). Size and Logic. Review of Symbolic Logic 2 (2):396-413.
    We show how to develop a multitude of rules of nonmonotonic logic from very simple and natural notions of size, using them as building blocks.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  45. Dov M. Gabbay & Andrzej Szałas (2009). Annotation Theories Over Finite Graphs. Studia Logica 93 (2/3):147 - 180.
    In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph's nodes. Such theories, which we call annotation theories^ can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  46. Dov M. Gabbay & Andrzej Szałas (2009). Voting by Eliminating Quantifiers. Studia Logica 92 (3):365 - 379.
    Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the “best compromise” varies and heavily depends on a particular situation. The method we propose in this paper depends on expressing individual preferences of voters and specifying properties of the resulting ranking by means of first-order (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  47. Dov M. Gabbay & Leendert van der Torre (2009). Preface for Studia Logica Special Issue (2). Studia Logica 93 (2/3):105 - 108.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  48. Dov M. Gabbay & Leendert van der Torre (2009). Preface for Studia Logica Special Issue (2). Studia Logica 93 (2-3):105-108.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  49. Dov M. Gabbay & John Woods (2009). Fallacies as Cognitive Virtues. In. In Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy. Springer Verlag. 57--98.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 160