- 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
Approximating operators and semantics for abstract dialectical frameworks
Artificial Intelligence 205 (C):39-70 (2013)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Realizability of three-valued semantics for abstract dialectical frameworks.Jörg Pührer - 2020 - Artificial Intelligence 278 (C):103198.
Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks.Jesse Heyninck, Gabriele Kern-Isberner, Tjitze Rienstra, Kenneth Skiba & Matthias Thimm - 2023 - Artificial Intelligence 317 (C):103876.
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.Hannes Strass & Johannes Peter Wallner - 2015 - Artificial Intelligence 226 (C):34-74.
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.
Conflict-tolerant semantics for argumentation frameworks.Ofer Arieli - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 28--40.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
On approximating shortest paths in weighted triangular tessellations.Prosenjit Bose, Guillermo Esteban, David Orden & Rodrigo I. Silveira - 2023 - Artificial Intelligence 318 (C):103898.
Abstract Argumentation in Artificial Intelligence. Problems of Interpretation and Adequacy of Semantics for Decision Making.Gustavo Adrián Bodanza - unknown
Generalized distributivity operators.Peter Lasersohn - 1998 - Linguistics and Philosophy 21 (1):83-93.
Approximating optimal social choice under metric preferences.Elliot Anshelevich, Onkar Bhardwaj, Edith Elkind, John Postl & Piotr Skowron - 2018 - Artificial Intelligence 264 (C):27-51.
Analytics
Added to PP
2020-12-22
Downloads
6 (#711,559)
6 months
5 (#1,552,255)
2020-12-22
Downloads
6 (#711,559)
6 months
5 (#1,552,255)
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.
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.Hannes Strass & Johannes Peter Wallner - 2015 - Artificial Intelligence 226 (C):34-74.
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms.Ringo Baumann & Hannes Strass - 2022 - Artificial Intelligence 305 (C):103680.
Grounded fixpoints and their applications in knowledge representation.Bart Bogaerts, Joost Vennekens & Marc Denecker - 2015 - Artificial Intelligence 224 (C):51-71.
Investigating subclasses of abstract dialectical frameworks.Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler & Stefan Woltran - 2020 - Argument and Computation 11 (1-2):191-219.
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.
An abstract framework for argumentation with structured arguments.Henry Prakken - 2010 - Argument and Computation 1 (2):93-124.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
The Carneades model of argument and burden of proof.Thomas F. Gordon, Henry Prakken & Douglas Walton - 2007 - Artificial Intelligence 171 (10-15):875-896.
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-68866f4b87-6mvtb uwo