A practical account into counting Dung's extensions by dynamic programming
From MaRDI portal
Publication:2694593
DOI10.1007/978-3-031-15707-3_30OpenAlexW4293180052MaRDI QIDQ2694593
Johannes K. Fichte, Ridhwan Dewoprabowo, Markus Hecher, Piotr Jerzy Gorczyca
Publication date: 4 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_30
Uses Software
Cites Work
- Using arguments for making and explaining decisions
- Towards fixed-parameter tractable algorithms for abstract argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- ASPARTIX-V19 -- an answer-set programming based system for abstract argumentation
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
- Inconsistency Proofs for ASP: The ASP - DRUPE Format
- Lower Bounds for QBFs of Bounded Treewidth
- A relational model of data for large shared data banks
This page was built for publication: A practical account into counting Dung's extensions by dynamic programming
