- 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
The computational complexity of ideal semantics
Artificial Intelligence 173 (18):1559-1591 (2009)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Bruce tesar and Paul Smolensky, learnability in optimality theory.Reinhard Blutner - 2002 - Linguistics and Philosophy 25 (1):65-80.
Computational semantics: an introduction to artificial intelligence and natural language comprehension.Eugene Charniak & Yorick Wilks (eds.) - 1976 - New York: distributors for the U.S.A. and Canada, Elsevier/North Holland.
E-type pronouns, DRT, dynamic semantics and the quantifier/variable-binding model.S. J. Barker - 1997 - Linguistics and Philosophy 20 (2):195-228.
The computational complexity of abduction.Tom Bylander, Dean Allemang, Michael C. Tanner & John R. Josephson - 1991 - Artificial Intelligence 49 (1-3):25-60.
The computational complexity of Angry Birds.Matthew Stephenson, Jochen Renz & Xiaoyu Ge - 2020 - Artificial Intelligence 280 (C):103232.
On the computational complexity of qualitative coalitional games.Michael Wooldridge & Paul E. Dunne - 2004 - Artificial Intelligence 158 (1):27-73.
On the computational complexity of coalitional resource games.Michael Wooldridge & Paul E. Dunne - 2006 - Artificial Intelligence 170 (10):835-871.
Computational complexity of terminological reasoning in BACK.Bernhard Nebel - 1988 - Artificial Intelligence 34 (3):371-383.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,404,117)
6 months
6 (#700,930)
2020-12-22
Downloads
7 (#1,404,117)
6 months
6 (#700,930)
Historical graph of downloads
Citations of this work
A tutorial on assumption-based argumentation.Francesca Toni - 2014 - Argument and Computation 5 (1):89-117.
Weighted argument systems: Basic definitions, algorithms, and complexity results.Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons & Michael Wooldridge - 2011 - Artificial Intelligence 175 (2):457-486.
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.
Characteristics of multiple viewpoints in abstract argumentation.Paul E. Dunne, Wolfgang Dvořák, Thomas Linsbichler & Stefan Woltran - 2015 - Artificial Intelligence 228 (C):153-178.
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.
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.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
An abstract, argumentation-theoretic approach to default reasoning.A. Bondarenko, P. M. Dung, R. A. Kowalski & F. Toni - 1997 - Artificial Intelligence 93 (1-2):63-101.
Computing ideal sceptical argumentation.P. M. Dung, P. Mancarella & F. Toni - 2007 - Artificial Intelligence 171 (10-15):642-674.
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-6686886f5-sqlzn uwo