An Extension of Fixpoint Logic with a Symmetry-Based Choice Construct

Information and Computation

Volumn 144, Issue 1, 1998, Pages 40-65

  Gire, F ^a   Hoang, H K ^a  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003084790     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2712     Document Type: Article

References (17)

1. Abiteboul, S., and Vianu, V. (1991), Non-determinism in logic-based languages, Ann. Math. Artificial Intelligence 3, 151-186.
2. Abiteboul, S., and Vianu, V. (1991), Generic computation and its complexity, in "Proc. 23rd ACM Symp. on the Theory of Computing," pp. 209-219.
3. Cai, J., Furer, M., and Immerman, N. (1989), An optimal lower bound on the number of variables for graph identification, in "Proc 30th IEEE Conf. on Foundations of Computer Science," pp. 612-617.
4. Chandra, A., and Harel, D. (1980), Computable queries for relational databases, J. Comput. System Sci. 21(2), 156-178.
5. Chandra, A., and Harel, D. (1982), Structure and complexity of relational queries, J. Comput. System Sci. 25(1), 99-128.
6. Dawar, A. (1993), "Feasible Computation through Model Theory," Ph.D Thesis, University of Pennsylvania, Philadelphia.
7. Enderton, H. B. (1972), "A Mathematical Introduction to Logic," Academic Press, San Diego.
8. Gyssens, M., Van den Bussche, I., and Van Gucht, D. (1994), Expressiveness of efficient semi-deterministic choice constructs, in "ICALP 94," Vol. 820, Jerusalem, pp. 106-117.
9. Gurevich, Y., and Shelah, S. (1983), Fixed-point extensions of first order logic, in "Proc. 26th IEEE Symp. on Foundations of Computer Science," pp. 210-214.
10. Grumbach, S., and Tollu, C. (1992), Query languages with counters, in "Proc. 4th Int. Conf. Database Theory," Lecture Notes in Computer Science, Vol. 646, pp. 124-139, Springer-Verlag, Berlin/New York.
11. Immerman, N. (1982), Upper and lower bounds for first-order definability, J. Comput. System Sci. 25, 76-98.
12. Immerman, N. (1986), Relational queries computable in polynomial time, Inform. and Control 68, 86-104.
13. Immerman, N. (1987), Languages that capture complexity classes, SIAM J. Comput. 16, 760-778.
14. Immerman, N., and Lander, E. (1990), Describing graphs: a first-order approach to graph canonization, in "Complexity Theory Retrospective" (A. Selman, Ed.), pp. 59-81, Springer-Verlag, Berlin/New York.
15. Kolaitis, Ph. G., and Vardi, M. Y. (1992), Fixpoint logic vs. infinitary logic in finite-model theory, in "Proc. 7th IEEE Symp. on Logic in Computer Science," pp. 46-57.
16. Vardi, M. (1982), The complexity of relational query languages, in "Proc. 14th ACM Symp. on the Theory of Computing," pp. 137-146.
17. Van den Bussche, I., and Van Gucht, D. (1992), Semi-determinism, in "Proc. 11th ACM Symp. Principles of Database Systems," pp. 191-201.