Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Jesse Heyninck"'
Autor:
Jesse Heyninck, Christian Straßer
Publikováno v:
Argument & Computation, Vol 12, Iss 1, Pp 3-47 (2021)
Structured argumentation formalisms, such as ASPIC + , offer a formal model of defeasible reasoning. Usually such formalisms are highly parametrized and modular in order to provide a unifying framework in which different forms of reasoning can be exp
Externí odkaz:
https://doaj.org/article/ea957e1b6e6941eaaec3b9fa3af8f6f6
Publikováno v:
Artificial Intelligence, 317:103876. Elsevier Science
Artificial Intelligence, 317:103876. ELSEVIER SCIENCE BV
Heyninck, J, Kern-Isberner, G, Rienstra, T, Skiba, K & Thimm, M 2023, ' Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks ', Artificial Intelligence, vol. 317, 103876 . https://doi.org/10.1016/j.artint.2023.103876
Artificial Intelligence, 317:103876. ELSEVIER SCIENCE BV
Heyninck, J, Kern-Isberner, G, Rienstra, T, Skiba, K & Thimm, M 2023, ' Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks ', Artificial Intelligence, vol. 317, 103876 . https://doi.org/10.1016/j.artint.2023.103876
For propositional beliefs, there are well-established connections between belief revision, defeasible conditionals, and nonmonotonic inference. In argumentative contexts, such connections have not yet been investigated. On the one hand, the exact rel
Publikováno v:
Argument & Computation. :1-2
Autor:
Jesse Heyninck, Ofer Arieli
Publikováno v:
International Journal of Approximate Reasoning. 139:28-53
Simple contrapositive assumption-based argumentation frameworks are a general setting for structured argumentation, providing a robust approach to reasoning with arguments and counter-arguments. In this paper we extend these frameworks with prioritie
Autor:
Ofer Arieli, Jesse Heyninck
Publikováno v:
International Journal of Approximate Reasoning. 121:103-124
Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation, with tight links to different forms of defeasible reasoning. In this paper we study the Dung semantics for extended forms of assumption-
Publikováno v:
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI'22): AAAI Technical Track on Knowledge Representation and Reasoning, 36(5), 5692-5699
dialectical frameworks (in short, ADFs) are a unifying model of formal argumentation, where argumentative relations between arguments are represented by assigning acceptance conditions to atomic arguments. This idea is generalized by letting acceptan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04fc9441f0e091b71800fe6bb4ee4c34
https://cris.maastrichtuniversity.nl/en/publications/7f13d784-567f-4f07-887e-e889696aefb5
https://cris.maastrichtuniversity.nl/en/publications/7f13d784-567f-4f07-887e-e889696aefb5
Autor:
Jesse Heyninck, Ofer Arieli
Publikováno v:
KR
Approximation fixpoint theory (AFT) constitutes an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonotonic reasoning, such as l
Publikováno v:
KR
For propositional beliefs, there are well-established connections between belief revision, defeasible conditionals and nonmonotonic inference. In argumentative contexts, such connections have not yet been investigated. On the one hand, the exact rela
The exact relationship between formal argumentation and nonmonotonic logics is a research topic that keeps on eluding researchers despite recent intensified efforts. We contribute to a deeper understanding of this relation by investigating characteri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cdba7f2ec4547f8c40b435d8b41b423
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 87:187-226
This is a survey of some recent results relating Dung-style semantics for different types of logical argumentation frameworks and several forms of reasoning with maximally consistent sets (MCS) of premises. The related formalsims are also examined wi