Sciweavers

Share
6 search results - page 1 / 2
» Monadic datalog over finite structures with bounded treewidt...
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
10 years 1 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
TOCL
2010
103views more  TOCL 2010»
8 years 8 months ago
Monadic datalog over finite structures of bounded treewidth
Georg Gottlob, Reinhard Pichler, Fang Wei
LPAR
2010
Springer
8 years 11 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...
AAAI
2008
9 years 3 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
JCT
2006
110views more  JCT 2006»
9 years 1 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
books