Advertisement

Relational Complexity and Higher Order Logics

  • José Maria Turull-TorresEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9616)

Abstract

Relational machines (RM) were introduced as abstract machines that compute queries to relational database instances (dbi’s), that are generic (i.e., that preserve isomorphisms). As RM’s cannot discern between tuples that are equivalent in first order logic with k variables, Relational Complexity was introduced as a complexity theory where the input dbi to a query is measured as its \(\textit{size}_k\), i.e., as the number of classes in the equivalence relation of equality of \(\mathrm {FO}^k\) types of k-tuples in the dbi. We describe the basic notions of Relational Complexity, and survey known characterizations of some of its main classes through different fixed point logics and through fragments of second and third order logics.

Keywords

Turing Machine Order Logic Relation Symbol Input Structure Relational Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Abiteboul, S., Vardi, M.Y., Vianu, V.: Computing with infinitary logic. Theor. Comput. Sci. 149(1), 101–128 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Abiteboul, S., Vardi, M.Y., Vianu, V.: Fixpoint logics, relational machines, and computational complexity. J. ACM 44(1), 30–56 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Abiteboul, S., Vianu, V.: Generic computation and its complexity. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 5–8 May 1991, pp. 209–219 (1991)Google Scholar
  4. 4.
    Abiteboul, S., Vianu, V.: Computing with first-order logic. J. Comput. Syst. Sci. 50(2), 309–335 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Arroyuelo, J., Turull-Torres, J.M.: The existential fragment of third order logic and third order relational machines. In: Proceedings of the XX Argentine Conference on Computer Science, CACIC 2014, Buenos Aires, Argentina, 20–24 October 2014, pp. 324–333 (2014)Google Scholar
  6. 6.
    Dawar, A.: A restricted second order logic for finite structures. Inf. Comput. 143(2), 154–174 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dawar, A., Grädel, E.: Properties of almost all graphs and generalized quantifiers. Fundam. Inform. 98(4), 351–372 (2010)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Dawar, A., Lindell, S., Weinstein, S.: Infinitary logic and inductive definability over finite structures. Inf. Comput. 119(2), 160–175 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Ebbinghaus, H., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1995)zbMATHGoogle Scholar
  10. 10.
    Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) Complexity of Computation, New York City, 18–19 April 1973. SIAM-AMS Proceedings, vol. 7, pp. 21–74 (1974)Google Scholar
  11. 11.
    Ferrarotti, F.A., Grosso, A.L., Turull-Torres, J.M.: Semantic restrictions over second-order logic. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2013. LNCS, vol. 7693, pp. 174–197. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  12. 12.
    Ferrarotti, F.A., Paoletti, A.L., Torres, J.M.T.: Redundant relations in relational databases: a model theoretic perspective. J. UCS 16(20), 2934–2955 (2010)zbMATHGoogle Scholar
  13. 13.
    Ferrarotti, F.A., Turull Torres, J.M.: The relational polynomial-time hierarchy and second-order logic. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 48–76. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Grosso, A.L.: SOF: A Logic Where Relation Variables Are Interpreted with Unions of FO Types. Doctoral thesis (in Spanish). Universidad Nacional De San Luis, Argentina (2013)Google Scholar
  15. 15.
    Grosso, A.L., Turull-Torres, J.M.: A second-order logic in which variables range over relations with complete first-order types. In: Ochoa, S.F., Meza, F., Mery, D., Cubillos, C. (eds.) SCCC 2010, Proceedings of the XXIX International Conference of the Chilean Computer Science Society, Antofagasta, Chile, 15–19 November 2010, pp. 270–279. IEEE Computer Society (2010)Google Scholar
  16. 16.
    Grosso, A.L., Turull-Torres, J.M.: Expressibility of the logic SOF on classes of structures of bounded FO types. In: Proceedings of the XVIII Argentine Conference on Computer Science, CACIC 2012, Bahía Blanca, Argentina, 8–12 October 2012, pp. 1389–1398 (2012)Google Scholar
  17. 17.
    Gurevich, Y., Shelah, S.: Fixed-point extensions of first-order logic. Ann. Pure Appl. Logic 32, 265–280 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Gurevich, Y., Shelah, S.: On finite rigid structures. J. Symb. Log. 61(2), 549–562 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Kolaitis, P.G., Vardi, M.Y.: Infinitary logics and 0–1 laws. Inf. Comput. 98(2), 258–294 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2004)CrossRefzbMATHGoogle Scholar
  21. 21.
    Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1–22 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Turull-Torres, J.M.: Capturing relational NEXPTIME with a fragment of existential third order logic. J. Comput. Sci. Technol. (2015, to appear). Selected article from the XXI Argentine Conference on Computer Science, CACIC 2015, Junín, Argentina, 5–9 October 2015 (2015)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Depto. de Ingeniería e Investigaciones TecnológicasUniversidad Nacional de La MatanzaBuenos AiresArgentina
  2. 2.Massey UniversityPalmerston NorthNew Zealand

Personalised recommendations