6 search results - page 1 / 2 » On the expressive power of CNF formulas of bounded tree- and... |
WG
1998
Springer
13 years 9 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
DAM
2011
13 years 14 days ago
2011
ICDT
2001
ACM
13 years 10 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
CP
2000
Springer
13 years 9 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...