Dynamic Programming on Tree Decompositions with D-FLAT

Abseher, Michael; Bliem, Bernhard; Hecher, Markus; Moldovan, Marius; Woltran, Stefan

doi:10.1007/s13218-018-0531-2

Künstl Intell

2018

DOI: 10.1007/s13218-018-0531-2

|View full text |Cite

Dynamic Programming on Tree Decompositions with D-FLAT

Michael Abseher

Bernhard Bliem

Markus Hecher

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Reasoning in Assumption-Based Argumentation Using Tree-Decompositions

Popescu,

Wallner

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We address complex reasoning tasks in assumption-based argumentation (ABA) by developing dynamic programming algorithms based on tree-decompositions. As one of the prominent approaches in computational argumentation, our focus is on NP-hard reasoning in ABA. We utilize tree-width, a structural measure describing closeness to trees, for an approach to handle computationally complex tasks in ABA. We contribute to the state of the art by first showing that many reasoning tasks in ABA are fixed-parameter tractable w.r.t. tree-width using Courcelle’s theorem, informally signaling wide applicability of dynamic programming algorithms for ABA. Secondly, we develop such algorithms operating on tree-decompositions of given ABA frameworks. We instantiate the algorithms in the recent D-FLAT framework allowing for declarative and extensible specification of dynamic programming algorithms. In an experimental evaluation on a resulting prototype, we show promise of the approach in particular for complex counting tasks.

show abstract

Reasoning in Assumption-Based Argumentation Using Tree-Decompositions

Popescu,

Wallner

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Dynamic Programming on Tree Decompositions with D-FLAT

Cited by 1 publication

References 4 publications

Reasoning in Assumption-Based Argumentation Using Tree-Decompositions

Reasoning in Assumption-Based Argumentation Using Tree-Decompositions

Contact Info

Product

Resources

About