References of "Gabbay, Dov M. 30000217"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAn Equational Approach to Logic Programming
Gabbay, Dov M. UL

in Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz (2012)

Detailed reference viewed: 78 (0 UL)
Full Text
Peer Reviewed
See detailSequential Dynamic Logic
Bochman, Alexander; Gabbay, Dov M. UL

in Journal of Logic, Language and Information (2012), 21(3), 279--298

Detailed reference viewed: 103 (0 UL)
Full Text
Peer Reviewed
See detailWhat Is Negation as Failure?
Gabbay, Dov M. UL

in Logic Programs, Norms and Action - Essays in Honor of Marek J. Sergot on the Occasion of His 60th Birthday (2012)

Detailed reference viewed: 142 (0 UL)
Full Text
Peer Reviewed
See detailThe Equational Approach to CF2 Semantics
Gabbay, Dov M. UL

in Computational Models of Argument - Proceedings of COMMA 2012, Vienna Austria, September 10-12, 2012 (2012)

Detailed reference viewed: 28 (0 UL)
Full Text
Peer Reviewed
See detailTemporal Deontic Logic for the Generalised Chisholm Set of Contrary to Duty Obligations
Gabbay, Dov M. UL

in Deontic Logic in Computer Science - 11th International Conference DEON 2012, Bergen, Norway, July 16-18, 2012. Proceedings (2012)

Detailed reference viewed: 100 (0 UL)
Full Text
Peer Reviewed
See detailTwo dimensional Standard Deontic Logic [including a detailed analysis of the 1985 Jones-Pörn deontic logic system]
Boer, Mathijs De; Gabbay, Dov M. UL; Parent, Xavier UL et al

in Synthese (2012), 187(2), 623--660

Detailed reference viewed: 137 (0 UL)
Full Text
Peer Reviewed
See detailModelling defeasible and prioritized support in bipolar argumentation
Villata, Serena; Boella, Guido; Gabbay, Dov M. UL et al

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 163-197

Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is ... [more ▼]

Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is that they cannot encode defeasible support, for instance they cannot model an attack towards a support relation. In this paper, we introduce a way to model defeasible support in bipolar argumentation frameworks. We use the methodology of meta-argumentation in which Dung’s theory is used to reason about itself. Dung’s well-known admissibility semantics can be used on this meta-argumentation framework to compute the acceptable arguments, and all properties of Dung’s classical theory are preserved. Moreover, we show how different contexts can lead to the alternative strengthening of the support relation over the attack relation, and converse. Finally, we present two applications of our methodology for modeling support, the case of arguments provided with an internal structure and the case of abstract dialectical frameworks. [less ▲]

Detailed reference viewed: 111 (5 UL)
Full Text
Peer Reviewed
See detailA Numerical Approach to the Merging of Argumentation Networks
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Fisher, Michael; Torre, Leon; Dastani, Mehdi (Eds.) et al Computational Logic in Multi-Agent Systems (2012)

In this paper, we propose a numerical approach to the problem of merging of argumentation networks. The idea is to consider an augmented network containing the arguments and attacks of all networks to be ... [more ▼]

In this paper, we propose a numerical approach to the problem of merging of argumentation networks. The idea is to consider an augmented network containing the arguments and attacks of all networks to be merged and then associate a weight to each of its components based on how they are perceived by the agents associated with the local networks. The combined weighted network is then used to define a system of equations from which the overall strength of the arguments is calculated. [less ▲]

Detailed reference viewed: 121 (0 UL)
Full Text
Peer Reviewed
See detailEmbedding and automating conditional logics in classical higher-order logic
Benzmuller, Christoph; Gabbay, Dov M. UL; Genovese, Valerio UL et al

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 257-271

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and ... [more ▼]

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and about conditional logics. [less ▲]

Detailed reference viewed: 84 (4 UL)
Full Text
Peer Reviewed
See detailIntroducing Equational Semantics for Argumentation Networks
Gabbay, Dov M. UL

in ECSQARU (2011)

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 ... [more ▼]

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, etc, etc. The equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George Boole, Louis Couturat and Ernst Schroeder. [less ▲]

Detailed reference viewed: 93 (1 UL)
See detailConditionals and Modularity in General Logics
Gabbay, Dov M. UL; Schlechta, Karl

Book published by Springer (2011)

Detailed reference viewed: 82 (0 UL)
Full Text
Peer Reviewed
See detailArguing about the Trustworthiness of the Information Sources
Villata, Serena; Boella, Guido; Gabbay, Dov M. UL et al

in ECSQARU (2011)

Trust minimizes the uncertainty in the interactions among the information sources. To express the possibly conflicting motivations about trust and distrust, we reason about trust using argumentation ... [more ▼]

Trust minimizes the uncertainty in the interactions among the information sources. To express the possibly conflicting motivations about trust and distrust, we reason about trust using argumentation theory. First, we show how to model the sources and how to attack untrustworthy sources. Second, we provide a focused representation of trust about the sources in which trust concerns not only the sources but also the information items and the relation with other information. [less ▲]

Detailed reference viewed: 132 (0 UL)
Full Text
Peer Reviewed
See detailArgumentative Agents Negotiating on Potential Attacks
Boella, Guido; Gabbay, Dov M. UL; Perotti, Alan et al

in KES-AMSTA (2011)

When arguing, agents may want to discuss about the details after agreeing about the general problems. We propose to model this kind of situation using an extended argumentation framework with potential ... [more ▼]

When arguing, agents may want to discuss about the details after agreeing about the general problems. We propose to model this kind of situation using an extended argumentation framework with potential attacks. Agents negotiation about raising potential attacks or not, in order to maximize the number of their accepted arguments. The result of the negotiation process consists in the formation of coalitions composed by those agents which have found an agreement. The two proposed negotiation protocols have been implemented and an evaluation, addressed by means of experimental results, shows which combination of strategies and negotiation protocol allows the agents to optimize outcomes. [less ▲]

Detailed reference viewed: 98 (1 UL)
Full Text
Peer Reviewed
See detailReactive automata
Crochemore, Maxime; Gabbay, Dov M. UL

in Information and Computation (2011), 209(4), 692704

A reactive automaton has extra links whose role is to change the behaviour of the automaton. We show that these links do not increase the expressiveness of finite automata but that they can be used to ... [more ▼]

A reactive automaton has extra links whose role is to change the behaviour of the automaton. We show that these links do not increase the expressiveness of finite automata but that they can be used to reduce dramatically their state number both in the deterministic case and the non-deterministic case. Typical examples of regular expressions associated with deterministic automata of ex- ponential size according to the length of the expression show that reactive links provide an alternative representation of total linear size for the language [less ▲]

Detailed reference viewed: 42 (1 UL)
Full Text
Peer Reviewed
See detailDung’s Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce-Quine Dagger
Gabbay, Dov M. UL

in Logica Universalis (2011), 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– ... [more ▼]

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 ¬,∧,∨,→ 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 frames, predicate argumentation frames, etc., etc. We also offer the notion of logic proof as a geometrical walk along the nodes of a Dung network and thus we are able to offer a geometrical abstraction of the notion of inference based argumentation. Thus our paper is also a contribution to the question: “What is a logical system” in as much as it integrates logic with abstract argumentation networks [less ▲]

Detailed reference viewed: 117 (0 UL)
Full Text
Peer Reviewed
See detailObligations and prohibitions in Talmudic deontic logic
Abraham, Michael; Gabbay, Dov M. UL; Schild, Uri J.

in Artificial Intelligence and Law (2011), 19(2-3), 117148

Detailed reference viewed: 116 (1 UL)
Full Text
Peer Reviewed
See detailReactive intuitionistic tableaux
Gabbay, Dov M. UL

in Synthese (2011), 179(2), 253269

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

Detailed reference viewed: 80 (0 UL)
Full Text
Peer Reviewed
See detailCoalition Formation via Negotiation in Multiagent Systems with Voluntary Attacks
Boella, Guido; Gabbay, Dov M. UL; Perotti, Alan et al

in Procs. of the 22th Belgian-Netherlands Conference on Artificial Intelligence (BNAIC'10) (2010)

Argumentation networks are put forward by Dung considering only one kind of attack among argu- ments. In this paper, we propose to extend Dung’s argumentation framework with voluntary attacks in the ... [more ▼]

Argumentation networks are put forward by Dung considering only one kind of attack among argu- ments. In this paper, we propose to extend Dung’s argumentation framework with voluntary attacks in the context of multiagent systems, characterized by the possibility of the attacker to decide whether to attack or not. Enabling voluntary attacks impacts on the acceptability of the arguments in the framework, and therefore it becomes subject of debate between the agents. Agents can negotiate about which subset of voluntary attacks can be raised, and they form coalitions after the negotiation process. [less ▲]

Detailed reference viewed: 16 (0 UL)
Full Text
Peer Reviewed
See detailA Comment on Work by Booth and Co-authors
Gabbay, Dov M. UL; Schlechta, Karl

in Studia Logica (2010), 94(3), 403432

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, < and, where < is the usual ranked relation, and is a sub ... [more ▼]

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, < and, where < is the usual ranked relation, and is a sub-relation of <. They have, however, left open a characterization of the infinite case, which we treat here. [less ▲]

Detailed reference viewed: 102 (0 UL)
Full Text
Peer Reviewed
See detailSubsumption and Count as Relation in Arguments Ontologies
Boella, Guido; Gabbay, Dov M. UL; Villata, Serena

in Procs. of the 13th International Workshop on Non-Monotonic Reasoning (NMR'10) (2010)

The paper proposes a representation of the subsumption re- lation and of count as conditional in the context of argument ontologies. Starting from the weaker notion of classification represented by the ... [more ▼]

The paper proposes a representation of the subsumption re- lation and of count as conditional in the context of argument ontologies. Starting from the weaker notion of classification represented by the subsumption relation towards the stronger notion of count as, we show how to reason whether an argu- ment is accepted in ontologies involving these two notions. We adopt the methodology of meta-argumentation in order to model the design decisions. Argumentation, being able to handle contradictory information, is proposed as technique to reason about count as for ontology interoperability. [less ▲]

Detailed reference viewed: 24 (0 UL)