Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Argumentation in artificial intelligence
Artificial Intelligence
Preferred extensions as stable models*
Theory and Practice of Logic Programming
On bipolarity in argumentation frameworks
International Journal of Intelligent Systems - Bipolar Representations of Information and Preference Part 2: Reasoning and Learning
Arguments, Values and Baseballs: Representation of Popov v. Hayashi
Proceedings of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference
Political Engagement Through Tools for Argumentation
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Using clinical preferences in argumentation about evidence from clinical trials
Proceedings of the 1st ACM International Health Informatics Symposium
AFRA: Argumentation framework with recursive attacks
International Journal of Approximate Reasoning
Solving weighted argumentation frameworks with soft constraints
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Partial semantics of argumentation
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Modeling and solving AFs with a constraint-based tool: conarg
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Fundamenta Informaticae - Logic, Language, Information and Computation
A probabilistic approach to modelling uncertain logical arguments
International Journal of Approximate Reasoning
Aggregating evidence about the positive and negative effects of treatments
Artificial Intelligence in Medicine
A generalised framework for dispute derivations in assumption-based argumentation
Artificial Intelligence
Toward incremental computation of argumentation semantics: A decomposition-based approach
Annals of Mathematics and Artificial Intelligence
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
Probabilistic qualification of attack in abstract argumentation
International Journal of Approximate Reasoning
Argumentation frameworks as constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
The system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung's argumentation framework and generalizations thereof. ASPARTIX relies on a fixed disjunctive datalog program which takes an instance of an argumentation framework as input, and uses the answer-set solver DLV for computing the type of extension specified by the user.