References of "Gabbay, Dov M. 30000217"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSupport in Abstract Argumentation
Boella, Guido UL; Gabbay, Dov M. UL; van der Torre, Leon UL et al

in Proceedings of the Third International Conference on Computational Models of Argument (COMMA'10) (2010)

n this paper, we consider two drawbacks of Cayrol and Lagasque-Schiex's meta-argumentation theory to model bipolar argumentation frameworks. We consider first the “lost of admissibility” in Dung's sense ... [more ▼]

n this paper, we consider two drawbacks of Cayrol and Lagasque-Schiex's meta-argumentation theory to model bipolar argumentation frameworks. We consider first the “lost of admissibility” in Dung's sense and second, the definition of notions of attack in the context of a support relation. We show how to prevent these drawbacks by introducing support meta-arguments. Like the model of Cayrol and Lagasque-Schiex, our formalization confirms the use of meta-argumentation to reuse Dung's properties. We do not take a stance towards the usefulness of a support relation among arguments, though we show that if one would like to introduce them, it can be done without extending Dung's theory. Finally, we show how to use meta-argumentation to instantiate an argumentation framework to represent defeasible support. In this model of support, the support relation itself can be attacked. [less ▲]

Detailed reference viewed: 109 (0 UL)
Full Text
Peer Reviewed
See detailArguing about Trust in Multiagent Systems
Villata, Serena; Boella, Guido UL; Gabbay, Dov M. UL et al

in Proceedings of the 11th Symposium on Artificial Intelligence of the Italian Association for Artificial Intelligence (AIIA'10) (2010)

Trust in multiagent systems is used for seeking to minimize the uncertainty in the interactions among the agents. In this paper, we discuss how to use argumentation to reason about trust. Using the ... [more ▼]

Trust in multiagent systems is used for seeking to minimize the uncertainty in the interactions among the agents. In this paper, we discuss how to use argumentation to reason about trust. Using the methodology of meta-argumentation, first we represent the source of the information from which the argument is constructed in the abstract argumentation framework capturing the fact that b is attacked because b is from a particular source s. We show how a source of information can be attacked if it is not evaluated as trustworthy. Second, we provide a fine grained representation of the trust relationships between the information sources in which trust concerns not only the sources but also the single arguments and attack relations the sources propose. Moreover, we represent the evidences in support of the arguments which are put forward by the information sources and the agents can express arguments by referring to other agents’ arguments. Meta-argumentation allows us not to extend Dung’s abstract argumentation framework by introducing trust and to reuse those principles and properties defined for Dung’s framework. [less ▲]

Detailed reference viewed: 26 (0 UL)
Full Text
Peer Reviewed
See detailFallacies as Cognitive Virtues
Gabbay, Dov M. UL; Woods, John

in Logic, Games and Philosophy: Foundational Perspectives (2009)

In its recent attention to reasoning that is agent-based and target-driven, logic has re-taken the practical turn and recovered something of its historic mission. In so doing, it has taken on in a quite ... [more ▼]

In its recent attention to reasoning that is agent-based and target-driven, logic has re-taken the practical turn and recovered something of its historic mission. In so doing, it has taken on in a quite general way a game-theoretic character, precisely as it was with the theory of syllogistic refutation in the Topics and On Sophistical Refutations, where Aristotle develops winning strategies for disputations. The approach that the present authors take toward the logic of practical reasoning is one in which cognitive agency is inherently strategic in its orientation. In particular, as is typically the case, individual agents set cognitive targets for themselves opportunistically, that is, in such ways that the attainment of those targets can be met with resources currently or forseeably at their disposal. This not to say that human reasoning is so game-like as to be utterly tendentious. But it does make the point that the human player of the cognitive game has no general stake in accepting undertakings that he has no chance of making good on. Throughout its long history, the traditional fallacies have been characterized as mistakes that are attractive, universal and incorrigible. In the present essay, we want to begin developing an alternative understanding of the fallacies. We will suggest that, when they are actually employed by beings like us, they are defensible strategies in game-theoretically describable pursuit of cognitive (and other) ends. [less ▲]

Detailed reference viewed: 62 (0 UL)
Full Text
Peer Reviewed
See detailIndependence-Revision and Defaults
Gabbay, Dov M. UL; Schlechta, Karl

in Studia Logica (2009), 92(3), 381394

We investigate different aspects of independence here, in th e context of theory revision, generalizing slightly work by Chopra, Parikh, and Rodrigues, and in the context of prefere ntial reasoning

Detailed reference viewed: 72 (0 UL)
Full Text
Peer Reviewed
See detailReactive Preferential Structures and Nonmonotonic consequence
Gabbay, Dov M. UL; Schlechta, Karl

in Review of Symbolic Logic (The) (2009), 2(2), 414450

We introduce Information Bearing Relation Systems (IBRS) a s an abstraction of many logical systems. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very ... [more ▼]

We introduce Information Bearing Relation Systems (IBRS) a s an abstraction of many logical systems. 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 ”break” the strong coher ence properties of preferential structures by higher arrows, i.e. arrows, which do not go to points, but t o arrows themselves [less ▲]

Detailed reference viewed: 73 (0 UL)
See detailQuantification in Non-classical Logics
Gabbay, Dov M. UL; Shehtman, V.; Skvortsov, D.

Book published by Elsevier (2009)

Detailed reference viewed: 17 (0 UL)
Full Text
Peer Reviewed
See detailA Theory of Hierarchical Conditionals
Gabbay, Dov M. UL; Schlechta, Karl

in Journal of Logic, Language and Information (2009)

Detailed reference viewed: 16 (0 UL)
Full Text
Peer Reviewed
See detailModal Foundations for Argumentation Networks
Gabbay, Dov M. UL

in Studia Logica (2009)

Detailed reference viewed: 20 (0 UL)
Full Text
Peer Reviewed
See detailModal Logics of Reactive Frames
Gabbay, Dov M. UL; Marcelino, Sergio

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: 75 (0 UL)
Full Text
Peer Reviewed
See detailSize and Logic
Gabbay, Dov M. UL; Schlechta, Karl

in Review of Symbolic Logic (The) (2009), 2(2), 396404

Detailed reference viewed: 14 (0 UL)
See detailProof theory for Fuzzy logics
Metcalfe, George; Olivetti, Nicola; Gabbay, Dov M. UL

Book published by Springer (2009)

Detailed reference viewed: 66 (0 UL)
Full Text
Peer Reviewed
See detailMeta-Argumentation part 1
Boella, Guido UL; Gabbay, Dov M. UL; van der Torre, Leon UL et al

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: 33 (0 UL)
Full Text
Peer Reviewed
See detailA meta-model of access control in a fibred security language
Barker, Steve; Guido, Boella; Gabbay, Dov M. UL et al

in Studia Logica (2009), 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 ... [more ▼]

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 developed for domain-specific applications. We will argue that our general framework has a number of specific attractions and an implication of our work is to encourage a methodological shift from a study of the particulars of access control to its generalities. [less ▲]

Detailed reference viewed: 93 (0 UL)
Full Text
Peer Reviewed
See detailSemantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview
Gabbay, Dov M. UL

in Studia Logica (2009), 93(2-3), 357381

In 2005 the author introduced networks which allow attacks on attacks of any level. So if a→b reads a attacks b, then this attack can itself be attacked by another node c. This attack itself can attack ... [more ▼]

In 2005 the author introduced networks which allow attacks on attacks of any level. So if a→b reads a attacks b, 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. [less ▲]

Detailed reference viewed: 38 (3 UL)
Full Text
Peer Reviewed
See detailRoadmap for Preferential Logics
Gabbay, Dov M. UL; Schlechta, Karl

in Journal of Applied Non-Classical Logics (2009), 19(1), 4395

Detailed reference viewed: 76 (0 UL)
Full Text
Peer Reviewed
See detailVoting with Second Order Quantifier Elimination
Gabbay, Dov M. UL; Szalas, A.

in Studia Logica (2009), 92(3), 365379

Detailed reference viewed: 10 (0 UL)
Full Text
Peer Reviewed
See detailAnalysis of the Talmudic Argumentum A Fortiori Inference Rule (Kal-Vachomer) using Matrix Abduction
Abraham, Michael; Gabbay, Dov M. UL; Schild, U.

in Studia Logica (2009), 92(3), 281364

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 Ana- logy and the rule of Argumentum A Fortiori ... [more ▼]

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 Ana- logy and the rule of Argumentum A Fortiori. Given a matrix A with entries in {0,1},we allow for one or more blank squares in the matrix, say ai,j=?. The method allows us to decide whether to declare ai,j=0 or ai,j=1 or ai,j=? undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences. [less ▲]

Detailed reference viewed: 82 (0 UL)
Full Text
Peer Reviewed
See detailAnnotation theories over finite graphs
Gabbay, Dov M. UL; Szalas, A.

in Studia Logica (2009)

In the current paper we consider theories with vocabulary containing a num- ber of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations ... [more ▼]

In the current paper we consider theories with vocabulary containing a num- ber 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, approxim ate 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, specification of preferred models and model checking problem. We show that most of considered problems are NPTime -or co-NPTime -complete. In order to reduce the complexity for particular theories, we use second-order quantifier elimination. To our best knowledge none of existing methods works in the case of anno- tation theories. We then provide a new second-order quantifier elimination method for stratified theories, which is successful in the considered cases. The new result subsumes many other results, including those of [2, 28, 21]. [less ▲]

Detailed reference viewed: 54 (0 UL)
Full Text
Peer Reviewed
See detailReactive Preferencial Structures and Nonmonotonic consequence
Gabbay, Dov M. UL; Schlechta, K.

in Review of Symbolic Logic (2009)

Detailed reference viewed: 16 (0 UL)
Peer Reviewed
See detailNon-Monotonicity and Holicity in Quantum Logic
Gabbay, Dov M. UL; Engesser, Kurt; Lehmann, D.

in HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM LOGIC (2009)

Detailed reference viewed: 85 (0 UL)