6 search results - page 1 / 2 » Monadic datalog over finite structures of bounded treewidth |
PODS
2007
ACM
14 years 7 months ago
2007
ACM
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 ...
TOCL
2010
13 years 1 months ago
2010
LPAR
2010
Springer
13 years 4 months ago
2010
Springer
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...
AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
13 years 9 months ago
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. ...
JCT
2006
13 years 6 months ago
2006
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...