Monadic Datalog over Finite Structures with Bounded Treewidth
Summary: Compile MSO-definable properties on bounded-treewidth structures into monadic datalog over the structure+tree decomposition, avoiding finite tree automaton state explosion. Prove linear-time evaluation in both program and data size for this datalog fragment and validate with a new PRIMALITY algorithm and prototype experiments. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Georg Gottlob
- 2. Reinhard Pichler
- 3. Fang Wei
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,175 | Monadic Datalog and the Expressive Power of Languages for Web Information Extraction | 2002 | PODS | 9.0847701e-05 |
| 9,748 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 5.2795863e-05 |
Previous
Page 1 / 1
Next