Complexity-sensitive decision procedures for abstract argumentation (Q490451): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(9 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2013.10.001 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Cmodels / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gringo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RAReQS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mjollnir / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2013.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011844594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence in finite argument systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of semi-stable and stage semantics in argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational properties of argument systems satisfying graph-theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fixed-parameter tractable algorithms for abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided abstraction refinement for symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretical structures in logic programs and default theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Intertranslatability of Argumentation Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Theory and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of ideal semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical account of formal argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex optimization in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction-Based Algorithm for 2QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QBF-based formalization of abstract argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an Argumentation Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Splitting: A Simple Modification-Based Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bipolarity in argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about preferences in argumentation frameworks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2013.10.001 / rank
 
Normal rank

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity-sensitive decision procedures for abstract argumentation
scientific article

    Statements

    Complexity-sensitive decision procedures for abstract argumentation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2015
    0 references
    abstract argumentation
    0 references
    computational complexity
    0 references
    argumentation procedures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers