Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Logic-based technologies for multi-agent systems: a systematic literature review
Precisely when the success of artificial intelligence (AI) sub-symbolic techniques makes
them be identified with the whole AI by many non-computer-scientists and non-technical …
them be identified with the whole AI by many non-computer-scientists and non-technical …
Logic-based technologies for intelligent systems: State of the art and perspectives
Together with the disruptive development of modern sub-symbolic approaches to artificial
intelligence (AI), symbolic approaches to classical AI are re-gaining momentum, as more …
intelligence (AI), symbolic approaches to classical AI are re-gaining momentum, as more …
[HTML][HTML] Design and results of the second international competition on computational models of argumentation
Abstract Argumentation is a major topic in the study of Artificial Intelligence. Since the first
edition in 2015, advancements in solving (abstract) argumentation frameworks are assessed …
edition in 2015, advancements in solving (abstract) argumentation frameworks are assessed …
[PDF][PDF] Comparing Weak Admissibility Semantics to their Dung-style Counterparts--Reduct, Modularization, and Strong Equivalence in Abstract Argumentation
Abstract Semantics based on weak admissibility were recently introduced to overcome a
problem with self-defeating arguments that has not been solved for more than 25 years. The …
problem with self-defeating arguments that has not been solved for more than 25 years. The …
Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: A feasibility study
We employ graph convolutional networks for the purpose of determining the set of
acceptable arguments under preferred semantics in abstract argumentation problems. While …
acceptable arguments under preferred semantics in abstract argumentation problems. While …
Solving advanced argumentation problems with answer set programming
Powerful formalisms for abstract argumentation have been proposed, among them abstract
dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the …
dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the …
[PDF][PDF] Graph Neural Networks for Algorithm Selection in Abstract Argumentation.
We address the task of selecting the fastest algorithm, in terms of runtime, for determining
skeptical acceptance under preferred semantics in abstract argumentation frameworks out of …
skeptical acceptance under preferred semantics in abstract argumentation frameworks out of …
Structural constraints for dynamic operators in abstract argumentation
JP Wallner - Argument & Computation, 2020 - journals.sagepub.com
Many recent studies of dynamics in formal argumentation within AI focus on the well-known
formalism of Dung's argumentation frameworks (AFs). Despite the usefulness of AFs in many …
formalism of Dung's argumentation frameworks (AFs). Despite the usefulness of AFs in many …
Computing grounded extensions of abstract argumentation frameworks
An abstract argumentation framework is a directed graph such that the vertices of denote
abstract arguments and represents the attack relation between them. We present a new ad …
abstract arguments and represents the attack relation between them. We present a new ad …
Reasoning in assumption-based argumentation using tree-decompositions
We address complex reasoning tasks in assumption-based argumentation (ABA) by
develo** dynamic programming algorithms based on tree-decompositions. As one of the …
develo** dynamic programming algorithms based on tree-decompositions. As one of the …