Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Supportedly stable answer sets for logic programs with generalized atoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On principle-based evaluation of extension-based argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an Argumentation Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation in artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grounded fixpoints and their applications in knowledge representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le théorème de Zorn / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the evaluation of argumentation formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-stable semantics / 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: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform semantic treatment of default and autoepistemic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimate approximation and its application in nonmonotonic knowledge representation systems / 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: On the computational complexity of assumption-based argumentation for default reasoning. / 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: Computing ideal sceptical argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of ideal semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence in finite argument systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-sensitive decision procedures for abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3100233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The carneades model of argument and burden of proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Abstract Dialectical Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility in the Abstract Dialectical Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating operators and semantics for abstract dialectical frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instantiating Knowledge Bases in Abstract Dialectical Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks / rank
 
Normal rank

Revision as of 05:02, 11 July 2024

scientific article
Language Label Description Also known as
English
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
scientific article

    Statements

    Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (English)
    0 references
    0 references
    0 references
    18 December 2015
    0 references
    abstract dialectical frameworks
    0 references
    computational complexity
    0 references
    approximation fixpoint theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers