Author of the publication

A New Tree-Decomposition Based Algorithm for Answer Set Programming.

, , , , and . ICTAI, page 916-918. IEEE Computer Society, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough., , , and . KR, AAAI Press, (2010)Multicut on Graphs of Bounded Clique-Width., , , and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 115-126. Springer, (2012)Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Belief Merging within Fragments of Propositional Logic., , , and . ACM Trans. Comput. Log., 17 (3): 20:1-20:28 (2016)Fast Counting with Bounded Treewidth., , , and . LPAR, volume 5330 of Lecture Notes in Computer Science, page 436-450. Springer, (2008)The Parameterized Complexity of Positional Games., , , , and . ICALP, volume 80 of LIPIcs, page 90:1-90:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming., , , , and . LION, volume 7219 of Lecture Notes in Computer Science, page 130-144. Springer, (2012)Backdoors to Abduction., , and . IJCAI, page 1046-1052. IJCAI/AAAI, (2013)Merging in the Horn Fragment., , and . IJCAI, page 3041-3047. AAAI Press, (2015)The Parameterized Complexity of Abduction., , , and . AAAI, AAAI Press, (2012)