DBScholar

Back to papers

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)

Paper ID
1445
Venue
PODS
Year
2008
Pagerank
-
Overall Rank
13,752 | 5.65%
DOI
10.1145/1376916.1376925

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{bojanczyk_pods08,
        address = {New York, NY, USA},
        series = {{PODS} '08},
        title = {{Effective Characterizations of Tree Logics}},
        url = {https://dl.acm.org/doi/10.1145/1376916.1376925},
        doi = {10.1145/1376916.1376925},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bojańczyk, Mikołaj},
        year = {2008}
}

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