( 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

Peter 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)Multicut Algorithms via Tree Decompositions., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 167-179. Springer, (2010)Turbocharging Treewidth Heuristics., , , , and . Algorithmica, 81 (2): 439-475 (2019)Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements., , , and . ISAAC, volume 92 of LIPIcs, page 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Parameterized Complexity of Abduction., , , and . AAAI, page 743-749. AAAI Press, (2012)Belief merging within fragments of propositional logic., , , and . ECAI, volume 263 of Frontiers in Artificial Intelligence and Applications, page 231-236. IOS Press, (2014)Belief Revision with Bounded Treewidth., , and . LPNMR, volume 5753 of Lecture Notes in Computer Science, page 250-263. Springer, (2009)