Effective Characterizations of Tree Logics
Summary: Survey of algorithmic effective characterizations that decide, given a tree automaton, whether its recognized language is definable in a target tree logic. Covers path-/frontier-testable languages, fragments of Core XPath and MSO, giving automata-theoretic criteria and decidability results. (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
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 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,296 | Running Tree Automata on Probabilistic XML | 2009 | PODS | 5.5802694e-05 |
| 6,794 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS | 4.9244886e-05 |
| 13,674 | Trees, Automata and XML (Invited Tutorial) | 2004 | PODS | - |
| 5,055 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 5.7312839e-05 |
| 5,870 | Query Automata (extended abstract) | 1999 | PODS | 5.2943906e-05 |
| 3,117 | Processing Queries on Tree-Structured Data Efficiently | 2006 | PODS | 7.5407318e-05 |
| 4,073 | Two-Variable Logic on Data Trees and XML Reasoning | 2006 | PODS | 6.4719397e-05 |
| 13,585 | Monadic Datalog over Finite Structures with Bounded Treewidth | 2007 | PODS | - |
| 6,150 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS | 5.1846373e-05 |
| 2,584 | Expressive and efficient pattern languages for tree-structured data (extended abstract) | 2000 | PODS | 8.4948053e-05 |