Argumentation reasoning via circumscription with \textsc{pyglaf}

DOI10.3233/FI-2019-1808zbMATH Open1415.68214OpenAlexW2948092625WikidataQ127756053 ScholiaQ127756053MaRDI QIDQ5223206FDOQ5223206

Authors: M. Alviano 

Publication date: 17 July 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2019-1808

Recommendations

• Argumentation frameworks as constraint satisfaction problems
• On the computation of Top-\(k\) extensions in abstract argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Logical limits of abstract argumentation frameworks
• On the computational complexity of assumption-based argumentation for default reasoning.

zbMATH Keywords

abstract argumentation frameworkspropositional circumscriptionincremental solvingminimal model enumeration

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cited In (2)

• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• pyglaf

Uses Software

• circumscriptino

This page was built for publication: Argumentation reasoning via circumscription with \textsc{pyglaf}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223206)