References of "Gabbay, Dov M. 30000217"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailIntroducing reactive modal tableaux
Gabbay, Dov M. UL

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 55-79

This paper introduces the idea of reactive semantics and reactive Beth tableaux for modal logic and quotes some of its applications. The reactive idea is very simple. Given a system with states and the ... [more ▼]

This paper introduces the idea of reactive semantics and reactive Beth tableaux for modal logic and quotes some of its applications. The reactive idea is very simple. Given a system with states and the possibility of transitions moving from one state to another, we can naturally imagine a path beginning at an initial state and moving along the path following allowed transitions. If our starting point is s0, and the path is s0,s1,...,sn, then the system is ordinary non-reactive system if the options available at sn (i.e., which states t we can go to from sn) do not depend on the path s0,...,sn (i.e., do not depend on how we got to sn). Otherwise if there is such dependence then the system is reactive. It seems that the simple idea of taking existing systems and turning them reactive in certain ways, has many new applications. The purpose of this paper is to introduce reactive tableaux in particular and illustrate and present some of the applications of reactivity in general. Mathematically one can take a reactive system and turn it into an ordinary system by taking the paths as our new states. This is true but from the point of view of applications there is serious loss of information here as the applicability of the reactive system comes from the way the change occurs along the path. In any specific application, the states have meaning, the transitions have meaning and the paths have meaning. Therefore the changes in the system as we go along a path can have very important meaning in the context, which enhances the usability of the model. [less ▲]

Detailed reference viewed: 77 (4 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: 94 (0 UL)
Full Text
Peer Reviewed
See detailOverview on the connection between reactive Kripke models and argumentation networks
Gabbay, Dov M. UL

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

The collection in this special issue contains mainly papers on reactive Kripke semantics and on argumentation. This overview says a few words about how these papers fit in the general picture.

Detailed reference viewed: 73 (4 UL)
Full Text
Peer Reviewed
See detailEquational approach to argumentation networks
Gabbay, Dov M. UL

in Argument and Computation (2012), 3(2-3), 87--142

Detailed reference viewed: 72 (3 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: 76 (0 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: 62 (0 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: 93 (0 UL)
See detailConditionals and Modularity in General Logics
Gabbay, Dov M. UL; Schlechta, Karl

Book published by Springer (2011)

Detailed reference viewed: 60 (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: 78 (1 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: 77 (1 UL)
Full Text
Peer Reviewed
See detailReactive automata
Crochemore, Maxime; Gabbay, Dov M. UL

in Information & 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: 16 (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 & Law (2011), 19(2-3), 117148

Detailed reference viewed: 88 (0 UL)
See detailNon-Deductive Inference in the Talmud
Gabbay, Dov M. UL; Abraham, Michael; Schild, U.

Book published by College Publications (2010)

Detailed reference viewed: 23 (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: 11 (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: 82 (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: 17 (0 UL)
Full Text
Peer Reviewed
See detailObligations and Prohibitions in Talmudic Deontic Logic
Abraham, Michael; Gabbay, Dov M. UL; Schild, Uri J.

in DEON (2010)

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: OTA Talmudic obligation FTA Talmudic ... [more ▼]

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: OTA Talmudic obligation FTA Talmudic prohibition FDA Standard deontic prohibition ODA Standard deontic obligation [less ▲]

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

in Journal of Logic, Language and Information (2010), 19(1), 332

We introduce A-ranked preferential structures and combine them with an accessibility relation. A-ranked preferential structures are intermediate between sim- ple preferential structures and ranked ... [more ▼]

We introduce A-ranked preferential structures and combine them with an accessibility relation. A-ranked preferential structures are intermediate between sim- ple preferential structures and ranked structures. The additional accessibility relation allows us to consider only parts of the overall A-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. [less ▲]

Detailed reference viewed: 77 (0 UL)
Full Text
Peer Reviewed
See detailHigher-Order Coalition Logic
Boella, Guido UL; Gabbay, Dov M. UL; Genovese, Valerio UL et al

in Bibliothèque(s) : revue de l'Association des bibliothécaires de France (2010)

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in ... [more ▼]

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is reasoning about their abilities. We illustrate higher-order coalition logic to represent and reason about coalition formation and cooperation, we show a more general and expressive way to quantify over coalitions than quantified coalition logic, we give an axiomatization and prove completeness. [less ▲]

Detailed reference viewed: 36 (0 UL)
Full Text
Peer Reviewed
See detailModal Access Control Logic - Axiomatization, Semantics and FOl Theorem Proving
Genovese, Valerio UL; Rispoli, Daniele; Gabbay, Dov M. UL et al

in STAIRS 2010 (2010)

We present and study a Modal Access Control Logic (M-ACL) to specify and reason about access control policies. We identify canonical properties of well-known access control axioms. We provide a Hilbert ... [more ▼]

We present and study a Modal Access Control Logic (M-ACL) to specify and reason about access control policies. We identify canonical properties of well-known access control axioms. We provide a Hilbert-style proof-system and we prove soundness, completeness and decidability of the logic. We present a sound and complete embedding of Modal Access Control Logic into First-Order Logic. We show how to use SPASS theorem prover to reason about access control policies expressed as formulas of Modal Access Control Logic, and we compare our logic with existing ones. [less ▲]

Detailed reference viewed: 34 (0 UL)