Sciweavers

5 search results - page 1 / 1
» Courcelle's Theorem - A Game-Theoretic Approach
Sort
View
CORR
2011
Springer
166views Education» more  CORR 2011»
12 years 12 months ago
Courcelle's Theorem - A Game-Theoretic Approach
Joachim Kneis, Alexander Langer, Peter Rossmanith
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 12 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
LPNMR
2009
Springer
13 years 11 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
LPAR
2010
Springer
13 years 2 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 5 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei