- 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
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
Artificial Intelligence 226 (C):34-74 (2015)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
Approximating operators and semantics for abstract dialectical frameworks.Hannes Strass - 2013 - Artificial Intelligence 205 (C):39-70.
Reasoning in abstract dialectical frameworks using quantified Boolean formulas.Martin Diller, Johannes Peter Wallner & Stefan Woltran - 2015 - Argument and Computation 6 (2):149-177.
On the Computational Complexity of Best L1-approximation.Paulo Oliva - 2002 - Mathematical Logic Quarterly 48 (S1):66-77.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
On Modal μ-Calculus and Gödel-Löb Logic.Luca Alberucci & Alessandro Facchini - 2009 - Studia Logica 91 (2):145-169.
Intractability and the use of heuristics in psychological explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
On modal μ -calculus and gödel-löb logic.Luca Alberucci & Alessandro Facchini - 2009 - Studia Logica 91 (2):145 - 169.
The Measurement of Chinese Sentence Semantic Complexity.Shuqin Zhu, Jihua Song, Weiming Peng, Dongdong Guo & Jingbo Sun - 2020 - Complexity 2020:1-10.
Analytics
Added to PP
2020-12-22
Downloads
11 (#1,132,782)
6 months
8 (#352,539)
2020-12-22
Downloads
11 (#1,132,782)
6 months
8 (#352,539)
Historical graph of downloads
Citations of this work
Realizability of three-valued semantics for abstract dialectical frameworks.Jörg Pührer - 2020 - Artificial Intelligence 278 (C):103198.
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner & Stefan Woltran - 2022 - Artificial Intelligence 307 (C):103697.
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.Hannes Strass & Johannes Peter Wallner - 2015 - Artificial Intelligence 226 (C):34-74.
Structural constraints for dynamic operators in abstract argumentation.Johannes P. Wallner - 2020 - Argument and Computation 11 (1-2):151-190.
Grounded fixpoints and their applications in knowledge representation.Bart Bogaerts, Joost Vennekens & Marc Denecker - 2015 - Artificial Intelligence 224 (C):51-71.
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.
The Carneades model of argument and burden of proof.Thomas F. Gordon, Henry Prakken & Douglas Walton - 2007 - Artificial Intelligence 171 (10-15):875-896.
On the evaluation of argumentation formalisms.Martin Caminada & Leila Amgoud - 2007 - Artificial Intelligence 171 (5-6):286-310.
Computing ideal sceptical argumentation.P. M. Dung, P. Mancarella & F. Toni - 2007 - Artificial Intelligence 171 (10-15):642-674.
On principle-based evaluation of extension-based argumentation semantics.Pietro Baroni & Massimiliano Giacomin - 2007 - Artificial Intelligence 171 (10-15):675-700.
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-64dd777598-vk9kt uwo