Default logic and bounded treewidth

DOI10.1007/978-3-319-77313-1_10zbMath1504.68209arXiv1706.09393OpenAlexW2964201613MaRDI QIDQ5915667

Markus Hecher, Irina Schindler, Johannes K. Fichte

Publication date: 26 June 2018

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.09393

zbMATH Keywords

dynamic programmingpropositional logictree decompositionsparameterized algorithmsReiter's default logic

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (3)

Exploiting Database Management Systems and Treewidth for Counting ⋮ Default logic and bounded treewidth ⋮ A multiparametric view on answer set programming

This page was built for publication: Default logic and bounded treewidth