Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
scientific article

    Statements

    Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2021
    0 references
    complexity
    0 references
    probabilistic argumentation
    0 references
    structured argumentation
    0 references
    assumption-based argumentation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers