References of "Rodrigues, Odinaldo"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailDegrees of "in", "out" and "undecided" in Argumentation Networks
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Computational Models of Argument - Proceedings of COMMA 2016, Potsdam Germany, 12-16 September, 2016. (2016)

Detailed reference viewed: 10 (0 UL)
Peer Reviewed
See detailFurther Applications of the Gabbay-Rodrigues Iteration Schema in Argumentation and Revision Theories
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Computational Models of Rationality, Essays dedicated to Gabriele Kern-Isberner on the occasion of her 60th birthday (2016)

Detailed reference viewed: 17 (0 UL)
See detailProbabilistic Argumentation. An Equational Approach
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Logica Universalis (2015), abs/1503.05501

There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case ... [more ▼]

There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: a. the nature of the arguments involved; b. the membership relation in the set S of arguments; c. the attack relation; and d. the choice of extensions. Generically to add a new aspect (probabilistic, or fuzzy, or temporal, etc) to an argumentation network hS, R i can be done by adding this feature to each component a – d. This is a brute-force method and may yield a non-intuitive or meaningful result. A better way is to meaningfully translate the object system into another target system which does have the aspect required and then let the target system endow the aspect on the initial system. In our case we translate argumentation into classical propositional logic and get probabilistic argumentation from the translation. Of course what we get depends on how we translate. In fact, in this paper we introduce probabilistic semantics to abstract argumentation theory based on the equational approach to argumentation networks. We then compare our semantics with existing proposals in the literature including the approaches by M. Thimm and by A. Hunter. Our methodology in general is discussed in the conclusion. [less ▲]

Detailed reference viewed: 37 (5 UL)
Full Text
Peer Reviewed
See detailEquilibrium States in Numerical Argumentation Networks
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Logica Universalis (2015), 9(4), 411--473

Detailed reference viewed: 24 (1 UL)
Full Text
Peer Reviewed
See detailEquilibrium States in Numerical Argumentation Networks
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Logica Universalis (2014), abs/1408.6706

Detailed reference viewed: 19 (5 UL)
Full Text
Peer Reviewed
See detailAn equational approach to the merging of argumentation networks
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in J. Log. Comput. (2014), 24(6), 1253--1277

Detailed reference viewed: 21 (0 UL)
Full Text
Peer Reviewed
See detailA self-correcting iteration schema for argumentation networks
Gabbay, Dov M. UL; Rodrigues, Odinaldo

in Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, September 9-12, 2014 (2014)

Detailed reference viewed: 17 (2 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: 48 (0 UL)
Peer Reviewed
See detailBelief Revision
Gabbay, Dov M. UL; Russo, Alessandra; Rodrigues, Odinaldo

in Handbook of Philosophical Logic (2008)

Detailed reference viewed: 11 (1 UL)
Full Text
Peer Reviewed
See detailBelief Revision in Non-classical Logic II
Gabbay, Dov M. UL; Russo, Alessandra; Rodrigues, Odinaldo

in Review of Symbolic Logic (The) (2008), 1(03), 267304

Detailed reference viewed: 25 (1 UL)
Full Text
Peer Reviewed
See detailCommon Foundations for Belief Revision, Belief Merging and Voting
Gabbay, Dov M. UL; Pigozzi, Gabriella UL; Rodrigues, Odinaldo

in Formal Models of Belief Change in Rational Agents (2007)

In this paper, we consider a number of different ways of reasoning about voting as a problem of conciliating contradictory interests. The mechanisms that do the reconciliation are belief revision and be ... [more ▼]

In this paper, we consider a number of different ways of reasoning about voting as a problem of conciliating contradictory interests. The mechanisms that do the reconciliation are belief revision and be- lief merging. By investigating the relationship between different voting strategies and their associated counterparts in revision theory, we find that whereas the counting mechanism of the voting process is more easily done at the meta-level in belief merging, it can be brought to the object level in base revision. In the former case, the counting can b e tweaked according to the aggregation procedure used, whereas in base revision, we can only rely on the notion of minimal change and hence the syntactical representation of the voters’ preferences plays a crucial part in the process. This highlights the similarities between the revi sion approaches on the one hand and voting on the other, but also opens up a numb er of interesting questions. [less ▲]

Detailed reference viewed: 14 (0 UL)