- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Abstract solvers for Dung’s argumentation frameworks
Argument and Computation 9 (1):41-72 (2018)
Abstract
solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way via graphs. Compared to traditional methods like pseudo-code descriptions, abstract solvers have...Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The third and fourth international competitions on computational models of argumentation: Design, results and analysis.Stefano Bistarelli, Lars Kotthoff, Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit, Francesco Santini & Carlo Taticchi - 2024 - Argument and Computation:1-73.
On abstract modular inference systems and solvers.Yuliya Lierler & Miroslaw Truszczynski - 2016 - Artificial Intelligence 236 (C):65-89.
Answer-set programming encodings for argumentation frameworks.Uwe Egly, Sarah Alice Gaggl & Stefan Woltran - 2010 - Argument and Computation 1 (2):147-177.
Effects of questioning unaware problem solvers in a "verbal conditioning" task.Theodore R. Dixon & Alan E. Moulton - 1970 - Journal of Experimental Psychology 83 (3p1):431.
Applied ethicists: Naysayers or problem solvers?Wendell Wallach - 2010 - Interaction Studies 11 (2):283-289.
Before and after Dung: Argumentation in AI and Law.T. J. M. Bench-Capon - 2020 - Argument and Computation 11 (1-2):221-238.
Theory and applications of satisfiability testing - SAT 2009: 12th international conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009: proceedings.Oliver Kullmann (ed.) - 2009 - Berlin: Springer.
Before and after Dung: Argumentation in AI and Law.Francesca Toni - 2020 - Argument and Computation 11 (1-2):221-238.
On the power of clause-learning SAT solvers as resolution engines.Knot Pipatsrisawat & Adnan Darwiche - 2011 - Artificial Intelligence 175 (2):512-525.
Analytics
Added to PP
2018-07-25
Downloads
42 (#571,533)
6 months
11 (#282,469)
2018-07-25
Downloads
42 (#571,533)
6 months
11 (#282,469)
Historical graph of downloads
References found in this work
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.Phan Minh Dung - 1995 - Artificial Intelligence 77 (2):321-357.
Coherence in finite argument systems.Paul E. Dunne & T. J. M. Bench-Capon - 2002 - Artificial Intelligence 141 (1-2):187-203.
Audiences in argumentation frameworks.Trevor J. M. Bench-Capon, Sylvie Doutre & Paul E. Dunne - 2007 - Artificial Intelligence 171 (1):42-71.
Complexity-sensitive decision procedures for abstract argumentation.Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner & Stefan Woltran - 2014 - Artificial Intelligence 206 (C):53-78.
Methods for solving reasoning problems in abstract argumentation – A survey.Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner & Stefan Woltran - 2015 - Artificial Intelligence 220 (C):28-63.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-99fc7d78b-xhc6d uwo