Advertisement

PBINT, A Logic for Modelling Search Problems Involving Arithmetic

  • Shahab Tasharrofi
  • Eugenia Ternovska
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6397)

Abstract

Motivated by computer science challenges, Grädel and Gurevich [13] suggested to extend the approach and methods of finite model theory beyond finite structures, an approach they called Metafinite Model Theory. We develop this direction further, in application to constraint specification/modelling languages. Following [27], we use a framework based on embedded model theory, but with a different background structure, the structure of arithmetic which contains at least (ℕ; 0, 1, + , ×, < , || ||), where ||x|| returns the size of the binary encoding of x. We prove that on these structures, we can unconditionally capture NP using a variant of a guarded logic. This improves the result of [27] (and thus indirectly [13]) by eliminating the small cost condition on input structures.

As a consequence, our logic (an idealized specification language) allows one to represent common arithmetical problems such as integer factorization or disjoint scheduling naturally, with built-in arithmetic, as opposed to using a binary encoding. Thus, this result gives a remedy to a problem with practical specification languages, namely that there are common arithmetical problems that can be decided in NP but cannot be axiomatized naturally in current modelling languages. We give some examples of such axiomatizations in PBINT and explain how our result applies to constraint specification/modelling languages.

Keywords

Model Check Modelling Language Search Problem Background Structure Descriptive Complexity 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions (extended abstract). In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 283–293 (1992)Google Scholar
  2. 2.
    Buss, S.R.: Bounded arithmetic. PhD thesis, Princeton University (1985)Google Scholar
  3. 3.
    Cadoli, M., Palopoli, L., Schaerf, A., Vasile, D.: Np-spec: An executable specification language for solving all problems in np. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, pp. 16–30. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Chandra, A., Harel, D.: Computable queries for relational databases. Journal of Computer and System Sciences 21, 156–178 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Proc. of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science, pp. 24–30 (1964)Google Scholar
  6. 6.
    Cook, S., Kolokolova, A.: A second-order system for polytime reasoning based on grädel’s theorem. In: Proceedings of Sixteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 177–186 (2001)Google Scholar
  7. 7.
    Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. TOCL 9(2), 1–51 (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of computation, SIAM-AMC proceedings, vol. 7, pp. 43–73 (1974)Google Scholar
  9. 9.
    Frisch, A.M., Grum, M., Jefferson, C., Hernandez, B.M., Miguel, I.: The essence of essence: A constraint language for specifying combinatorial problems. In: Proc. of the Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 73–88 (2005)Google Scholar
  10. 10.
    Gebser, M., Schaub, T., Thiele, S.: Gringo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266–271. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. In: PODS 2001 (2001)Google Scholar
  12. 12.
    Grädel, E.: Finite Model Theory and Descriptive Complexity, pp. 125–230. Springer, Heidelberg (2007)Google Scholar
  13. 13.
    Grädel, E., Gurevich, Y.: Metafinite model theory. Inf. Comput. 140(1), 26–81 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Grädel, E., Kreutzer, S.: Descriptive complexity theory for constraint databases. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 67–81. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  15. 15.
    Grädel, E., Meer, K.: Descriptive complexity theory over the real numbers. Mathematics of Numerical Analysis: Real Number Algorithms 32, 381–403 (1996)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Immerman, N.: Relational queries computable in polynomial time. In: STOC 1982: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 147–152 (1982)Google Scholar
  17. 17.
    Immerman, N.: Descriptive complexity (1999)Google Scholar
  18. 18.
    Leivant, D.: A foundational delineation of computational feasibility. In: LICS 1991: Proceedings of the sixth Annual IEEE Symposium on Logic in Computer Science, pp. 2–11 (1991)Google Scholar
  19. 19.
    Libkin, L.: Elements of Finite Model Theory (2004)Google Scholar
  20. 20.
    Libkin, L.: Embedded Finite Models and Constraint Databases, pp. 257–338. Springer, Heidelberg (2007)Google Scholar
  21. 21.
    Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: Proc. AAAI 2005 (2005)Google Scholar
  22. 22.
    Mitchell, D.G., Ternovska, E.: Expressiveness and abstraction in essence. Constraints 13(2), 343–384 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Skelley, A.: Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy. PhD thesis, University of Toronto (2005)Google Scholar
  24. 24.
    Suciu, D.: Domain-independent queries on databases with external functions. Theor. Comput. Sci. 190(2), 279–315 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Syrjänen, T.: Lparse 1.0 User’s Manual (2000), http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz
  26. 26.
    Tasharrofi, S., Ternovska, E.: Built-in arithmetic in knowledge representation languages. In: Proc. of Logic and Search, LaSh 2010 (2010)Google Scholar
  27. 27.
    Ternovska, E., Mitchell, D.G.: Declarative programming of search problems with built-in arithmetic. In: Proc. of 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 942–947 (2009)Google Scholar
  28. 28.
    Topor, R.: Safe database queries with arithmetic relations. In: Proc. 14th Australian Computer Science Conf., pp. 1–13 (1991)Google Scholar
  29. 29.
    Wittocx, J., Marien, M.: The IDP System, KU Leuven (June 2008), www.cs.kuleuven.be/~dtai/krr/software/idpmanual.pdf

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Shahab Tasharrofi
    • 1
  • Eugenia Ternovska
    • 1
  1. 1.Simon Fraser UniversityCanada

Personalised recommendations