The succinctness of first-order logic on linear orders

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 438-447

  Grohe, Martin ^a   Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATABASE SYSTEMS; FINITE AUTOMATA; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES; XML;

FINITE MODEL THEORY; LINEAR TIME TEMPORAL LOGIC (LTL); SUCCINCTNESS;

FORMAL LOGIC;

EID: 4544277997     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319638     Document Type: Conference Paper

References (16)

1. M. Adler and N. Immerman. An n! lower bound on formula size. ACM Transactions on Computational Logic, 4(3):296-314, 2003. Journal version of LICS'04 paper.
2. N. Alechina and N. Immerman. Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of the IGPL, 8(3):325-338, 2000.
3. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition, 1999.
4. 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. Special issue for selected papers from LICS'97.
5. M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. Annals of pure and applied logic, 2004. Accepted for publication. Journal version of LICS'02 paper.
6. M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS'03), pages 188-197, 2003.
7. G. Gottlob and Ch. Koch. Monadic datalog and the expressive power of web information extraction languages. Journal of the ACM, 51(1):74-113, 2004. Journal version of PODS'02 paper.
8. M. Grohe and N. Schweikardt. Comparing the succinctness of monadic query languages over finite trees. In Proceedings of the 17th International Workshop on Computer Science Logic (CSL'03), volume 2803 of Lecture Notes in Computer Science, pages 226-240. Springer, 2003.
9. M. Grohe and N. Schweikardt. The succinctness of first-order logic on linear orders. Full version of LICS'04 paper. Available at http://www. informatik.hu-berlin.de/~schweika/publications.html.
10. N. Immerman. Descriptive Complexity. Springer, 1999.
11. H. Kamp. Tense Logic and the theory of linear order. PhD thesis, University of California, Los Angeles, 1968.
12. F. Neven. Design and Analysis of Query Languages for Structured Documents - A Formal and Logical Approach. PhD thesis, Limburgs Universitair Centrum, 1999.
13. F. Neven and T. Schwentick. Query automata over finite trees. Theoretical Computer Science, 275(1-2):633-674, 2002. Journal version of PODS'99 paper.
14. L.J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.
15. M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing (STOC'82), pages 137-146, 1982.
16. + is exponentially more succinct than CTL. In Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'99), volume 1738 of Lecture Notes in Computer Science, pages 110-121. Springer, 1999.