The computational complexity of ideal semantics
type: Item
instance of: scholarly article
title: The computational complexity of ideal semantics
zbMATH Open document ID: 1185.68666
author: Paul E. Dunne
published in: Artificial Intelligence
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5650759
zbMATH Keywords: computational properties of argumentation
zbMATH Keywords: abstract argumentation frameworks
zbMATH Keywords: assumption-based argumentation
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.artint.2009.09.001
OpenAlex ID: W2115268056
cites work: Argumentation in artificial intelligence
cites work: On the unique satisfiability problem
cites work: An abstract, argumentation-theoretic approach to default reasoning
cites work: Functions computable with nonadaptive queries to NP
cites work: On computing Boolean connectives of characteristic functions
cites work: On unique satisfiability and the threshold behavior of randomized reductions
cites work: On the computational complexity of assumption-based argumentation for default reasoning.
cites work: Graph theoretical structures in logic programs and default theories
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Dialectic proof procedures for assumption-based, admissible argumentation
cites work: Computing ideal sceptical argumentation
cites work: Computational properties of argument systems satisfying graph-theoretic constraints
cites work: Coherence in finite argument systems.
cites work: Two party immediate response disputes: Properties and efficiency
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Complexity Results for Nonmonotonic Logics
cites work: Computing functions with parallel queries to NP
cites work: Q4385525
cites work: On the relation between default and autoepistemic logic
cites work: A comparison of polynomial time reducibilities
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3221403
cites work: A logic for default reasoning
cites work: NP is as easy as detecting unique solutions
cites work: Q4536329
cites work: Bounded Query Classes
DOI: 10.1016/J.ARTINT.2009.09.001
Recommended article: Computational complexity of the semantics of some natural language constructions
Recommended article: Quotient Complexity of Ideal Languages
Recommended article: Quotient complexity of ideal languages
Recommended article: Q3495341
Recommended article: Context semantics, linear logic, and computational complexity
Recommended article: Q3000099
Recommended article: Nondeterministic Complexity of Operations on Closed and Ideal Languages
Recommended article: Fixed-parameter complexity of semantics for logic programs
Recommended article: Q4736513
Recommended article: Parametric properties of ideal semantics
description: scientific article; zbMATH DE number 5650759