Follow
Martin Diller
Title
Cited by
Cited by
Year
An extension-based approach to belief revision in abstract argumentation
M Diller, A Haret, T Linsbichler, S Rümmele, S Woltran
International Journal of Approximate Reasoning 93, 395-423, 2018
802018
Solving advanced argumentation problems with answer set programming
G Brewka, M Diller, G Heissenberger, T Linsbichler, S Woltran
Theory and Practice of Logic Programming 20 (3), 391-431, 2020
362020
Reasoning in abstract dialectical frameworks using quantified Boolean formulas
M Diller, JP Wallner, S Woltran
Argument & Computation 6 (2), 149-177, 2015
192015
Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas.
M Diller, JP Wallner, S Woltran
COMMA, 241-252, 2014
152014
Investigating subclasses of abstract dialectical frameworks
M Diller, A Keshavarzi Zafarghandi, T Linsbichler, S Woltran
Argument & Computation 11 (1-2), 191-219, 2020
132020
EMIL: extracting meaning from inconsistent language: towards argumentation using a controlled natural language interface
H Strass, A Wyner, M Diller
International Journal of Approximate Reasoning 112, 55-84, 2019
112019
Investigating Subclasses of Abstract Dialectical Frameworks.
M Diller, AK Zafarghandi, T Linsbichler, S Woltran
COMMA, 61-72, 2018
112018
Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation
M Diller, SA Gaggl, P Gorczyca
Logic and Argumentation: 4th International Conference, CLAR 2021, Hangzhou …, 2021
82021
Study of the polymorphism of the Patagonian Calceolaria polyrhiza (Calceolariaceae) using decision tree and sequential covering rule induction
MM Strelin, A Cosacov, M Diller, AN Sérsic
Botanical Journal of the Linnean Society 173 (3), 487-500, 2013
82013
A Behavioural Characterization of Computational Systems
JO Blanco, R CHERINI, M Diller, P GARCÍA
na, 2011
62011
Realising argumentation using answer set programming and quantified boolean formulas
M Diller
Technische Universität Wien, 2019
52019
Admissibility in Probabilistic Argumentation.
C Baier, M Diller, C Dubslaff, SA Gaggl, H Hermanns, N Käfer
KR, 87-98, 2021
42021
Defeasible acerules: A prototype
M Diller, A Wyner, H Strass
Proceedings of the 12th International Conference on Computational Semantics …, 2017
42017
Admissibility in Probabilistic Argumentation
N Käfer, C Baier, M Diller, C Dubslaff, SA Gaggl, H Hermanns
Journal of Artificial Intelligence Research 74, 957–1009-957–1009, 2022
32022
Strategies in Flexible Dispute Derivations for Assumption-based Argumentation
M Diller, SA Gaggl, P Gorczyca
Proceedings of the Fourth International Workshop on Systems and Algorithms …, 2022
32022
Applications of ASP in formal argumentation
M Diller, W Dvorák, J Pührer, J Wallner, S Woltran
Proc. of TAASP Workshop, 2018
32018
Traffic Networks Become Argumentation Frameworks
M Diller
URL: http://argumentationcompetition. org/2017/Traffic. pdf, 2017
32017
Interpreters as computational mechanisms
J Blanco, R Cherini, M Diller, P Garcia
8th Conference on Computing and Philosophy (ECAP), octubre, 2010
32010
Solving reasoning problems on abstract dialectical frameworks via quantified Boolean formulas
M Diller
22014
Making sense of conflicting (defeasible) rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization
M Diller, A Wyner, H Strass
Proceedings of the 13th International Conference on Computational Semantics …, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20