References of "Rienstra, Tjitze"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailNew Weak Admissibility Semantics for Abstract Argumentation
Dauphin, Jérémie UL; Rienstra, Tjitze; van der Torre, Leon UL

in International Conference on Logic and Argumentation (2021)

Baumann, Brewka and Ulbricht recently introduced weak admissibility as an alternative to Dung’s notion of admissibility, and they used it to define weakly preferred, weakly complete and weakly grounded ... [more ▼]

Baumann, Brewka and Ulbricht recently introduced weak admissibility as an alternative to Dung’s notion of admissibility, and they used it to define weakly preferred, weakly complete and weakly grounded semantics of argumentation frameworks. In earlier work, we introduced two variants of their new semantics which we called qualified and semi-qualified semantics. We analysed all known variants of weak admissibility semantics with respect to some of the principles discussed in the literature on abstract argumentation, as well as some new principles we introduced to distinguish them all. Such a principle-based analysis can be used not only for selecting a semantics for an application, or for algorithmic design, but also for further research into weak admissibility semantics. In this paper, we introduce six new kinds of semantics based on weak admissibility, and we provide an initial principle-based analysis. The analysis illustrates various ways in which the new semantics improve on existing ones. [less ▲]

Detailed reference viewed: 42 (1 UL)
Full Text
Peer Reviewed
See detailA Principle-Based Analysis of Weakly Admissible Semantics
Dauphin, Jérémie UL; Rienstra, Tjitze; van der Torre, Leon UL

in Computational Models of Argument - Proceedings of COMMA 2020, Perugia Italy, September 4-11, 2020 (2020)

Baumann, Brewka and Ulbricht recently introduced weak admissibility as an alternative to Dung’s notion of admissibility, and they use it to define weakly preferred, weakly complete and weakly grounded ... [more ▼]

Baumann, Brewka and Ulbricht recently introduced weak admissibility as an alternative to Dung’s notion of admissibility, and they use it to define weakly preferred, weakly complete and weakly grounded semantics of argumentation frameworks. In this paper we analyze their new semantics with respect to the principles discussed in the literature on abstract argumentation. Moreover, we introduce two variants of their new semantics, which we call qualified and semiqualified semantics, and we check which principles they satisfy as well. Since the existing principles do not distinguish our new semantics from the ones of Baumann et al., we also introduce some new principles to distinguish them. Besides selecting a semantics for an application, or for algorithmic design, our new principle-based analysis can also be used for the further search for weak admissibility semantics. [less ▲]

Detailed reference viewed: 64 (8 UL)
Full Text
Peer Reviewed
See detailArgumentation as Exogenous Coordination
van der Torre, Leon UL; Rienstra, Tjitze; Gabbay, Dov M. UL

in It's All About Coordination (2018)

Formal argumentation is one of the most popular approaches in modern logic and reasoning. The theory of abstract argumentation introduced by Dung in 1995 has shifted the focus from the internal structure ... [more ▼]

Formal argumentation is one of the most popular approaches in modern logic and reasoning. The theory of abstract argumentation introduced by Dung in 1995 has shifted the focus from the internal structure of arguments to relations among arguments, and temporal dynamics for abstract argumentation was proposed by Barringer, Gabbay and Woods in 2005. In this tradition, we see arguments as reasoning processes, and the interaction among them as a coordination process.We argue that abstract argumentation can adopt ideas and techniques from formal theories of coordination, and as an example we propose a model of sequential abstract argumentation loosely inspired by Reo’s model of exogenous coordination. We show how the argumentation model can represent the temporal dynamics of the liar paradox and predator-prey like behaviour. [less ▲]

Detailed reference viewed: 108 (5 UL)
Full Text
Peer Reviewed
See detailProbabilistic Abstract Argumentation Based on SCC Decomposability
Rienstra, Tjitze; Thimm, Matthias; Liao, Beishui UL et al

in Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona 30 October - 2 November 2018. (2018)

In this paper we introduce a new set of general principles for probabilistic abstract argumentation. The main principle is a probabilistic analogue of SCC decomposability, which ensures that the ... [more ▼]

In this paper we introduce a new set of general principles for probabilistic abstract argumentation. The main principle is a probabilistic analogue of SCC decomposability, which ensures that the probabilistic evaluation of an argumentation framework complies with the probabilistic (in)dependencies implied by the graph topology. We introduce various examples of probabilistic semantics and determine which principles they satisfy. Our work also provides new insights into the relationship between abstract argumentation and the theory of Bayesian networks. [less ▲]

Detailed reference viewed: 70 (6 UL)