Comparing the succinctness of monadic query languages over finite trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2803, Issue , 2003, Pages 226-240

  Grohe, Martin ^a   Schweikardt, Nicole ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Finite Model Theory; Fixed Point Logics; Monadic Datalog; Monadic Second Order Logic; Succinctness; Tree like structures; Calculus

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; QUERY LANGUAGES; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

DATALOG; FINITE MODEL THEORY; FIXED-POINT LOGIC; MONADIC SECOND-ORDER LOGIC; SUCCINCTNESS; TREE-LIKE STRUCTURES;

COMPUTER CIRCUITS;

EID: 21144458916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_20     Document Type: Review

References (26)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
2. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of databases. Addison-Wesley, 1995.
3. N. Alechina and N. Immerman. Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of the IGPL, 8(3):325-338, 2000.
4. M. Adler and N. Immerman. An n! lower bound on formula size. In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, pages 197-206, 2001.
5. A. Chandra and D. Hard. Structure and complexity of relational queries. Journal of Computer and Systems Sciences, 25:99-128, 1982.
6. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
7. Revised version of: Deterministic algorithms for k-SAT based on covering codes and local search, ICALP'00, LNCS volume 1853.
8. Heinz-Dieter Ebbinghaus and Jörg Flum. Finite model theory. Springer, New York, second edition, 1999.
9. K. Etessami, M. Y. Vardi, and Th. Wilke. First-order logic with two variables and unary temporal logic. Information and Computation, 179(2):279-295, 2002.
10. R. Fagin. Monadic generalized spectra. Zeitschrift fur mathematische Logik und Grundlagen der mathematik, 21:89-96, 1975.
11. Markus Frick and Martin Grobe. The complexity of first-order and monadic second-order logic revisited. Journal version of LICS'02 paper. Available at http://www.dcs.ed.ac.uk/home/grohe/pub.html, 2003.
12. Markus Frick, Martin Grohe, and Christoph Koch. Query evaluation on compressed trees. In 18th IEEE Symposium on Logic in Computer Science (LICS'03), Ottawa, Canada, June 2003.
13. M. F. Fernandez, J. Siméon, and Ph. Wadler. An algebra for XML query. In S. Kapoor and S. Prasad, editors, Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'00), volume 1974 of Lecture Notes in Computer Science, pages 11-45. Springer-Verlag, 2000.
14. Georg Gottlob and Christoph Koch. Monadic datalog and the expressive power of web information extraction languages. Submitted, November 2002. Journal version of PODS'02 paper. Available as CoRR report arXiv:cs.DB/0211020.
15. E. Grädel and M. Otto. On Logics with Two Variables. Theoretical Computer Science, 224:73-113, 1999.
16. M. Grohe and N. Schweikardt. Comparing the succinctness of monadic query languages over finite trees. Technical Report EDI-INF-RR-0168, School of Informatics, University of Edinburgh, 2003.
17. H. Hosoya and B. C. Pierce. XDuce: A typed XML processing language (preliminary report). In D. Suciu and G. Vossen, editors, International Workshop on the Web and Databases, 2000.
18. Reprinted in The Web and Databases, Selected Papers, Springer LNCS volume 1997, 2001.
19. Neil Immerman. Descriptive complexity. Springer, New York, 1999.
20. H. Kamp. Tense Logic and the theory of linear order. PhD thesis, University of California, Los Angeles, 1968.
21. Christoph Koch. Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree-automata based approach. In Proceedings of the 29th Conference on Very Large Data Bases, 2003. To appear.
22. Frank Neven. Design and Analysis of Query Languages for Structured Documents - A Formal and Logical Approach. PhD thesis, Limburgs Universitair Centrum, 1999.
23. Frank Neven and Thomas Schwentick. Query automata over finite trees. Theoretical Computer Science, 275(1-2):633-674, 2002. Journal version of PODS'00 paper.
24. Wolfgang Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages, volume 3. Springer, New York, 1996.
25. Moshe Y. Vardi. Reasoning about the past with two-way automata. In K.G. Larsen, S. Skyum, and G. Winskel, editors, 25th International Colloquium on Automata, Languages and Programming (ICALP'98), volume 1443 of Lecture Notes in Computer Science, pages 628-641. Springer-Verlag, 1998.
26. T. Wilke. CTL+ is exponentially more succinct than CTL. In C. P. Rangan, V. Raman, and R. Ramanujam, editors, Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in Computer Science, pages 110-121. Springer-Verlag, 1999.