First-order queries over one unary function

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

Volumn 4207 LNCS, Issue , 2006, Pages 334-348

  Durand, A ^a   Olive, F ^b  

^a INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

^b AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FUNCTIONS; THEOREM PROVING; VOCABULARY CONTROL;

CONSTANT DELAY; MONADIC PREDICATES; QUANTIFIER ELIMINATION; QUASI-UNARY STRUCTURE;

QUERY LANGUAGES;

EID: 33750288327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_22     Document Type: Conference Paper

References (16)

1. G. Bagan. MSO queries on tree decomposable structures are computable with linear delay. Computer Science Logic'06 (this volume), 2006.
2. B. Courcelle. Linear delay enumeration and monadic second-order logic, submitted, 2006.
3. A. Durand, R. Fagin, and B. Loescher. Spectra with only unary function symbols. In M. Nielsen and W. Thomas, editors, Computer Science Logic, selected paper of CSL'97, LNCS 1414, pages 111-126. Springer, 1998.
4. A. Durand and E. Grandjean. The complexity of acyclic conjunctive queries revisited. Draft, 2005.
5. A. Durand and E. Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logic, 2006. To appear.
6. A. Durand, E. Grandjean, and F. Olive. New results on arity vs. number of variables. Research report 20-2004, LIF, Marseille, France, April 2004.
7. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree decompositions. Journal of the ACM, 49(6):716-752, 2002.
8. M. Frick and M. Grohe. Deciding first-order properties of locally tree decomposable structures. Journal of the ACM, 48:1184-1206, 2001.
9. Y. Gurevich. The decision problem for standard classes. J. Symb. Logic, 41(2):pp.460-464, 1976.
10. Y. Gurevich and S. Shelah. On spectra of one unary function. In 18th IEEE Conference in Logic in Computer Science, IEEE Computer Society, pages 291-300, 2003.
11. L. Libkin. Elements of finite model theory. EATCS Series. Springer, 2004.
12. S. Lindell. A normal form for first-order logic over doubly-linked data structures. Submitted, 2006.
13. C. Papadimitriou and M. Yannakakis. On the complexity of database queries. Journal of Computer and System Sciences, 58(3):407-427, 1999.
14. D. Seese. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science, 6(6):505-526, December 1996.
15. M. Y. Vardi. On the complexity of bounded-variable queries. In ACM Symposium on Principles of Database Systems, pages 260-276. ACM Press, 1995.
16. M. Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Databases, pages 82-94, 1981.