Search results for 'Valerio Genovese M. Gabbay' (try it on Scholar)

150 found
Sort by:
  1. 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.score: 4800.0
    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  
  2. Guido Boella, Dov M. Gabbay, Valerio Genovese & Leendert Van Der Torre (2009). Fibred Security Language. Studia Logica 92 (3):395 - 436.score: 4800.0
    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  
  3. Guido Boella, Dov M. Gabbay, Valerio Genovese & Leendert van der Torre (2009). Fibred Security Language. Studia Logica 92 (3):395-436.score: 4800.0
    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  
  4. Dov M. Gabbay (2006). Guido Boella Dov M. Gabbay Leendert van der Torre Serena Villata. Studia Logica 82:1-59.score: 525.0
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  5. Guido Boella Steve Barker, M. Gabbay Dov & Valerio Genovese (2009). A Meta-Model of Access Control in a Fibred Security Language. Studia Logica 92 (3).score: 495.0
    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 (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  6. Dov M. Gabbay & Andrzej Szałas (2007). Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. Studia Logica 87 (1):37 - 50.score: 150.0
    Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially using a (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. Dov M. Gabbay & Nicola Olivetti (1998). Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication. Studia Logica 61 (2):237-280.score: 150.0
    In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Dov M. Gabbay (2009). Semantics for Higher Level Attacks in Extended Argumentation Frames. Part 1: Overview. Studia Logica 93 (2/3):357 - 381.score: 150.0
    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  
  9. 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.score: 135.0
    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  
  10. M. Abraham, D. M. Gabbay & U. Schild (2012). Contrary to Time Conditionals in Talmudic Logic. Artificial Intelligence and Law 20 (2):145-179.score: 135.0
    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  
  11. M. Abraham, D. M. Gabbay & U. Schild (2011). Obligations and Prohibitions in Talmudic Deontic Logic. Artificial Intelligence and Law 19 (2-3):117-148.score: 135.0
    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  
  12. M. de Boer, D. Gabbay, X. Parent & M. Slavkova (forthcoming). Two Dimensional Deontic Logic. Synthese.score: 135.0
    No categories
     
    My bibliography  
     
    Export citation  
  13. Dov M. Gabbay, John Woods & Akihiro Kanamori (eds.) (2004). Handbook of the History of Logic. Elsevier.score: 120.0
    Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, The Emergence of Classical Logic, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  14. Dov M. Gabbay & Moshe Koppel (2011). Uncertainty Rules in Talmudic Reasoning. History and Philosophy of Logic 32 (1):63-69.score: 120.0
    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  
  15. Martin W. A. Caminada & Dov M. Gabbay (2009). A Logical Account of Formal Argumentation. Studia Logica 93 (2/3):109 - 145.score: 120.0
    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  
  16. D. Gabbay & J. M. Moravcsik (1973). Sameness and Individuation. Journal of Philosophy 70 (16):513-526.score: 120.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. Dov M. Gabbay (1977). Craig Interpolation Theorem for Intuitionistic Logic and Extensions Part III. Journal of Symbolic Logic 42 (2):269-271.score: 120.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. Dov M. Gabbay & Andrzej Szałas (2009). Voting by Eliminating Quantifiers. Studia Logica 92 (3):365 - 379.score: 120.0
    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  
  19. Dov M. Gabbay & Karl Schlechta (2010). A Theory of Hierarchical Consequence and Conditionals. Journal of Logic, Language and Information 19 (1):3-32.score: 120.0
    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  
  20. Dov M. Gabbay (ed.) (2002). Handbook of the Logic of Argument and Inference: The Turn Towards the Practical. Elsevier.score: 120.0
    The Handbook of the Logic of Argument and Inference is an authoritative reference work in a single volume, designed for the attention of senior undergraduates, graduate students and researchers in all the leading research areas concerned with the logic of practical argument and inference. After an introductory chapter, the role of standard logics is surveyed in two chapters. These chapters can serve as a mini-course for interested readers, in deductive and inductive logic, or as a refresher. Then follow two chapters (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  21. Dov M. Gabbay (ed.) (1994). What is a Logical System? Oxford University Press.score: 120.0
    This superb collection of papers focuses on a fundamental question in logic and computation: What is a logical system? With contributions from leading researchers--including Ian Hacking, Robert Kowalski, Jim Lambek, Neil Tennent, Arnon Avron, L. Farinas del Cerro, Kosta Dosen, and Solomon Feferman--the book presents a wide range of views on how to answer such a question, reflecting current, mainstream approaches to logic and its applications. Written to appeal to a diverse audience of readers, What is a Logical System? will (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  22. Alexander Bochman & Dov M. Gabbay (2012). Sequential Dynamic Logic. Journal of Logic, Language and Information 21 (3):279-298.score: 120.0
    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  
  23. Marcelo Finger & Dov M. Gabbay (1992). Adding a Temporal Dimension to a Logic System. Journal of Logic, Language and Information 1 (3):203-233.score: 120.0
    We introduce a methodology whereby an arbitrary logic system L can be enriched with temporal features to create a new system T(L). The new system is constructed by combining L with a pure propositional temporal logic T (such as linear temporal logic with Since and Until) in a special way. We refer to this method as adding a temporal dimension to L or just temporalising L. We show that the logic system T(L) preserves several properties of the original temporal logic (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  24. Dov M. Gabbay & Karl Schlechta (2009). Size and Logic. Review of Symbolic Logic 2 (2):396-413.score: 120.0
    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  
  25. Dov M. Gabbay (1972). A General Filtration Method for Modal Logics. Journal of Philosophical Logic 1 (1):29 - 34.score: 120.0
  26. Dov M. Gabbay & John Woods, Advice on Abductive Logic.score: 120.0
    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  
  27. Dov M. Gabbay & Sérgio Marcelino (2009). Modal Logics of Reactive Frames. Studia Logica 93 (2/3):405 - 446.score: 120.0
    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  
  28. Dov M. Gabbay & Leendert van der Torre (2009). Preface for Studia Logica Special Issue (2). Studia Logica 93 (2-3):105-108.score: 120.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  29. 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.score: 120.0
    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  
  30. Dov M. Gabbay (2009). Fibring Argumentation Frames. Studia Logica 93 (2/3):231 - 295.score: 120.0
    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  
  31. D. M. Gabbay (2002). A Theory of Hypermodal Logics: Mode Shifting in Modal Logic. [REVIEW] Journal of Philosophical Logic 31 (3):211-243.score: 120.0
    A hypermodality is a connective □ whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames.
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  32. Dov M. Gabbay (1995). A General Theory of Structured Consequence Relations. Theoria 10 (2):49-78.score: 120.0
    There are several areas in logic where the monotonicity of the consequence relation fails to hold. Roughly these are the traditional non-monotonic systems arising in Artificial Intelligence (such as defeasible logics, circumscription, defaults, ete), numerical non-monotonic systems (probabilistic systems, fuzzy logics, belief functions), resource logics (also called substructural logics such as relevance logic, linear logic, Lambek calculus), and the logic of theory change (also called belief revision, see Alchourron, Gärdenfors, Makinson [2224]). We are seeking a common axiomatic and semantical approach (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. Dov M. Gabbay & Karl Schlechta (2009). Independence — Revision and Defaults. Studia Logica 92 (3):381 - 394.score: 120.0
    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  
  34. Dov M. Gabbay (ed.) (2003). Many-Dimensional Modal Logics: Theory and Applications. Elsevier North Holland.score: 120.0
    Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  35. Dov M. Gabbay (2009). Modal Provability Foundations for Argumentation Networks. Studia Logica 93 (2/3):181 - 198.score: 120.0
    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  
  36. H. Barringer, D. M. Gabbay & J. Woods (2012). Modal and Temporal Argumentation Networks. Argument and Computation 3 (2-3):203 - 227.score: 120.0
    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  
  37. D. M. Gabbay & D. H. J. de Jongh (1974). A Sequence of Decidable Finitely Axiomatizable Intermediate Logics with the Disjunction Property. Journal of Symbolic Logic 39 (1):67-78.score: 120.0
  38. Dov M. Gabbay (1999). Fibring Logics. Clarendon Press.score: 120.0
    Modern applications of logic in mathematics, computer science, and linguistics use combined systems of different types of logic working together. This book develops a method for combining--or fibring--systems by breaking them into simple components which can be manipulated easily and recombined.
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. Dov M. Gabbay (1977). A New Version of Beth Semantics for Intuitionistic Logic. Journal of Symbolic Logic 42 (2):306-308.score: 120.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  40. D. M. Gabbay (2012). Equational Approach to Argumentation Networks. Argument and Computation 3 (2-3):87 - 142.score: 120.0
    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  
  41. D. M. Gabbay (1996). Fibred Semantics and the Weaving of Logics Part 1: Modal and Intuitionistic Logics. Journal of Symbolic Logic 61 (4):1057-1120.score: 120.0
    This is Part 1 of a paper on fibred semantics and combination of logics. It aims to present a methodology for combining arbitrary logical systems L i , i ∈ I, to form a new system L I . The methodology `fibres' the semantics K i of L i into a semantics for L I , and `weaves' the proof theory (axiomatics) of L i into a proof system of L I . There are various ways of doing this, we (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Dov M. Gabbay (1977). On Some New Intuitionistic Propositional Connectives. I. Studia Logica 36 (1-2):127 - 139.score: 120.0
    Direct download (5 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.score: 120.0
    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. 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.score: 120.0
    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  
  45. Marcello D'agostino, Dov M. Gabbay & Alessandra Russo (1997). Grafting Modalities Onto Substructural Implication Systems. Studia Logica 59 (1):65-102.score: 120.0
    We investigate the semantics of the logical systems obtained by introducing the modalities and into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Then, in the spirit of the LDS (Labelled Deductive Systems) methodology, we "import" this semantics into the classical proof system KE. This leads to the formulation of a uniform labelled refutation system for the new logics which is a natural extension of a system for substructural implication developed by the first two authors in (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  46. Dov M. Gabbay (1974). A Generalization of the Concept of Intensional Semantics. Philosophia 4 (2-3):251-270.score: 120.0
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  47. D. M. Gabbay & G. Malod (2002). Naming Worlds in Modal and Temporal Logic. Journal of Logic, Language and Information 11 (1):29-65.score: 120.0
    In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x, y)which states that two time points are at the same distance from the root. We provide the systems studied with complete axiomatizations and illustrate the expressive power gained for modal logic by simulating other logics. The completeness proofs rely on the fairly intuitive notion of a configuration in order (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  48. Yining Wu, Martin Caminada & Dov M. Gabbay (2009). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93 (2/3):383 - 403.score: 120.0
    In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  49. 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.score: 120.0
    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  
  50. Dov M. Gabbay (2003). A Practical Logic of Cognitive Systems. North Holland.score: 120.0
    Agenda Relevance is the first volume in the authors' omnibus investigation of the logic of practical reasoning, under the collective title, A Practical Logic of Cognitive Systems. In this highly original approach, practical reasoning is identified as reasoning performed with comparatively few cognitive assets, including resources such as information, time and computational capacity. Unlike what is proposed in optimization models of human cognition, a practical reasoner lacks perfect information, boundless time and unconstrained access to computational complexity. The practical reasoner is (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 150