- 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
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.Hannes Strass & Johannes Peter Wallner - 2015 - Artificial Intelligence 226 (C):34-74.
Realizability of three-valued semantics for abstract dialectical frameworks.Jörg Pührer - 2020 - Artificial Intelligence 278 (C):103198.
Representing the semantics of abstract dialectical frameworks based on arguments and attacks.Phan Minh Dung & Phan Minh Thang - 2018 - Argument and Computation 9 (3):249-267.
Neighborhood semantics for intentional operators.Graham Priest - 2009 - Review of Symbolic Logic 2 (2):360-373.
Initial sets in abstract argumentation frameworks.Yuming Xu & Claudette Cayrol - 2018 - Journal of Applied Non-Classical Logics 28 (2-3):260-279.
Abstract Argumentation in Artificial Intelligence. Problems of Interpretation and Adequacy of Semantics for Decision Making.Gustavo Adrián Bodanza - unknown
Categorical Abstract Algebraic Logic: Compatibility Operators and Correspondence Theorems.George Voutsadakis - 2018 - In Janusz Czelakowski (ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. Cham, Switzerland: Springer Verlag.
Investigating subclasses of abstract dialectical frameworks.Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler & Stefan Woltran - 2020 - Argument and Computation 11 (1-2):191-219.
Semantics: a reader.Steven Davis & Brendan S. Gillon (eds.) - 2004 - New York: Oxford University Press.
Completeness and decidability results for some propositional modal logics containing “actually” operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
Quantificational Operators and their Interpretation as Higher Order Operators. M. Böttner & W: Thümmel.H. Gust - 2000 - In Michael Böttner & Wolf Thümmel (eds.), Variable-Free Semantics. Secolo. pp. 132--161.
Reasoning in abstract dialectical frameworks using quantified Boolean formulas.Martin Diller, Johannes Peter Wallner & Stefan Woltran - 2015 - Argument and Computation 6 (2):149-177.
Analytics
Added to PP
2020-12-22
Downloads
5 (#1,510,250)
6 months
5 (#629,136)
2020-12-22
Downloads
5 (#1,510,250)
6 months
5 (#629,136)
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-7c76586df8-hc2g5 uwo