DocumentCode
2652188
Title
A New Tree-Decomposition Based Algorithm for Answer Set Programming
Author
Morak, Michael ; Musliu, Nystret ; Pichler, Reinhard ; Rummele, Stefan ; Woltran, Stefan
fYear
2011
fDate
7-9 Nov. 2011
Firstpage
916
Lastpage
918
Abstract
A promising approach to tackle intractable problems is given by combining decomposition methods with dynamic programming algorithms. One such decomposition concept is tree decomposition. In this paper, we provide a new algorithm using this combined approach for solving reasoning problems in propositional answer set programming.
Keywords
computability; dynamic programming; inference mechanisms; trees (mathematics); answer set programming; dynamic programming; intractable problems; reasoning problems; tree-decomposition based algorithm; Artificial intelligence; Conferences; answer set programming; dynamic programming; tree decomposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence (ICTAI), 2011 23rd IEEE International Conference on
Conference_Location
Boca Raton, FL
ISSN
1082-3409
Print_ISBN
978-1-4577-2068-0
Electronic_ISBN
1082-3409
Type
conf
DOI
10.1109/ICTAI.2011.154
Filename
6103445
Link To Document