A Practical Account into Counting Dung’s Extensions by Dynamic Programming
- 29 August 2022
- book chapter
- Published by Springer Nature
- p. 387-400
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach2022
- Rushing and Strolling among Answer Sets – Navigation Made EasyProceedings of the AAAI Conference on Artificial Intelligence, 2022
- Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally HardProceedings of the AAAI Conference on Artificial Intelligence, 2021
- Treewidth-Aware Quantifier Elimination and Expansion for QCSP2020
- Lower Bounds for QBFs of Bounded Treewidth2020
- µ-toksia: An Efficient Abstract Argumentation Reasoner2020
- Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology2020
- ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation2020
- Argumentation-Based Recommendations: Fantastic Explanations and How to Find Them2018
- A relational model of data for large shared data banksCommunications of the ACM, 1970