The computational complexity of ideal semantics
From MaRDI portal
Publication:1045987
DOI10.1016/J.ARTINT.2009.09.001zbMATH Open1185.68666OpenAlexW2115268056MaRDI QIDQ1045987
Publication date: 21 December 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2009.09.001
computational complexityabstract argumentation frameworksassumption-based argumentationcomputational properties of argumentation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- An abstract, argumentation-theoretic approach to default reasoning
- On the computational complexity of assumption-based argumentation for default reasoning.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Dialectic proof procedures for assumption-based, admissible argumentation
- NP is as easy as detecting unique solutions
- Bounded Query Classes
- Computing functions with parallel queries to NP
- A logic for default reasoning
- Semantical considerations on nonmonotonic logic
- On computing Boolean connectives of characteristic functions
- Computational properties of argument systems satisfying graph-theoretic constraints
- Coherence in finite argument systems.
- Graph theoretical structures in logic programs and default theories
- A comparison of polynomial time reducibilities
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Functions computable with nonadaptive queries to NP
- Complexity Results for Nonmonotonic Logics
- On the relation between default and autoepistemic logic
- Two party immediate response disputes: Properties and efficiency
- On the unique satisfiability problem
- On unique satisfiability and the threshold behavior of randomized reductions
Cited In (29)
- Argument graphs and assumption-based argumentation
- Domain expansion for ASP-programs with external sources
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Design and results of the second international competition on computational models of argumentation
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Weighted argumentation for analysis of discussions in Twitter
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Characterizing strong equivalence for argumentation frameworks
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
- On the complexity of semantic self-minimization
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Open Problems in Abstract Argumentation
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Quotient complexity of ideal languages
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Complexity-sensitive decision procedures for abstract argumentation
- Quotient Complexity of Ideal Languages
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Characteristics of multiple viewpoints in abstract argumentation
- On Syntactic versus Computational Views of Approximability
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Complexity of abstract argumentation under a claim-centric view
- Uses and computation of imprecise probabilities from statistical data and expert arguments
- On argumentation logic and propositional logic
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions
- Methods for solving reasoning problems in abstract argumentation -- a survey
Recommendations
- Quotient Complexity of Ideal Languages 👍 👎
- Context semantics, linear logic, and computational complexity 👍 👎
- Computational complexity of the semantics of some natural language constructions 👍 👎
- Quotient complexity of ideal languages 👍 👎
- Parametric properties of ideal semantics 👍 👎
- Nondeterministic Complexity of Operations on Closed and Ideal Languages 👍 👎
- Fixed-parameter complexity of semantics for logic programs 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: The computational complexity of ideal semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045987)
