( en | de | ru )

 

Disambiguation of "Rümmele, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Merging in the Horn Fragment.

, , and . ACM Trans. Comput. Log., 18 (1): 6:1-6:32 (2017)

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.

Annette Rümmele

Petra Rümmele

Frank Rümmele

Klaus Rümmele

Edgar Rümmele

 

Other publications of authors with the same name

Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Belief Merging within Fragments of Propositional Logic., , , and . ACM Trans. Comput. Log., 17 (3): 20 (2016)Multicut on Graphs of Bounded Clique-Width., , , and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 115-126. Springer, (2012)Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough., , , and . KR, AAAI Press, (2010)Counting and Enumeration Problems with Bounded Treewidth., , and . LPAR (Dakar), volume 6355 of Lecture Notes in Computer Science, page 387-404. Springer, (2010)Benchmarking Database Systems for Graph Pattern Matching., , , and . DEXA (1), volume 8644 of Lecture Notes in Computer Science, page 226-241. Springer, (2014)On the Parameterized Complexity of Belief Revision., , , and . IJCAI, page 3149-3155. AAAI Press, (2015)Belief Revision with Bounded Treewidth., , and . LPNMR, volume 5753 of Lecture Notes in Computer Science, page 250-263. Springer, (2009)A Dynamic-Programming Based ASP-Solver., , , and . JELIA, volume 6341 of Lecture Notes in Computer Science, page 369-372. Springer, (2010)A New Tree-Decomposition Based Algorithm for Answer Set Programming., , , , and . ICTAI, page 916-918. IEEE Computer Society, (2011)