Skip to main content

On the Complexity of Model Expansion

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6397))

Abstract

We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a given formula. This is the logical task underlying many practical constraint languages and systems for representing and solving search problems, and our work is motivated by the need to provide theoretical foundations for these. We present results on both data and combined complexity of MX for several fragments and extensions of FO that are relevant for this purpose, in particular the guarded fragment GF k of FO and extensions of FO and GF k with inductive definitions. We present these in the context of the two closely related, but more studied, problems of model checking and finite satisfiability. To obtain results on FO(ID), the extension of FO with inductive definitions, we provide translations between FO(ID) with FO(LFP), which are of independent interest.

Earlier versions of this work were presented at LCC 2006 and LaSh 2006. The work presented here was carried out while the first two authors were PIMS post-doctoral fellows at Simon Fraser University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 49(3), 217–274 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barrington, D.M., Immerman, N., Straubing, H.: On uniformity within NC 1. Journal of Computer and System Sciences 41(3), 274–306 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cook, S.A.: A hierarchy for nondeterministic time complexity. Journal of Computer and System Sciences 7(4), 343–353 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  4. Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. ACM transactions on computational logic (TOCL) 9(2), 1–52 (2008)

    Article  MATH  Google Scholar 

  5. Ebbinghaus, H.D., Flum, J.: Finite model theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  6. Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of computation, SIAM-AMC, vol. 7, pp. 43–73 (1974)

    Google Scholar 

  7. Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. In: Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2001), pp. 195–206 (2001)

    Google Scholar 

  8. Grädel, E.: Capturing Complexity Classes by Fragments of Second Order Logic. Theoretical Computer Science 101, 35–57 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Grädel, E.: On the restraining power of guards. Journal of Symbolic Logic 64, 1719–1742 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Grädel, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3, 53–69 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Grädel, E., Otto, M.: On logics with two variables. Theoretical Computer Science 224, 73–113 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Grädel, E., Walukiewicz, I.: Guarded fixed point logic. In: Fourteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1999), pp. 45–55 (1999)

    Google Scholar 

  13. Immerman, N.: Relational queries computable in polytime. In: Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 147–152 (1982)

    Google Scholar 

  14. Immerman, N.: Descriptive complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  15. Jurdzinski, M.: Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters 69, 119–124 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  17. Liu, Y., Levesque, H.J.: A tractability result for reasoning with incomplete first-order knowledge bases. In: 18th Int. Joint Conf. on Artif. Intell. (IJCAI 2003), pp. 83–88 (2003)

    Google Scholar 

  18. Livchak, A.: Languages for polynomial-time queries. In: Computer-based modeling and optimization of heat-power and electrochemical objects, p. 41 (1982)

    Google Scholar 

  19. Mitchell, D., Ternovska, E.: A framework for representing and solving NP search problems. In: 20th National Conf. on Artif. Intell. (AAAI), pp. 430–435 (2005)

    Google Scholar 

  20. Patterson, M., Liu, Y., Ternovska, E., Gupta, A.: Grounding for model expansion in k-guarded formulas with inductive definitions. In: 22nd International Joint Conference on Artificial Intelligence, IJCAI 2007 (2007)

    Google Scholar 

  21. Stockmeyer, L.: The Complexity of Decision Problems in Automata Theory. Ph.D. thesis, MIT (1974)

    Google Scholar 

  22. Tasharrofi, S., Ternovska, E.: Capturing NP for search problems with built-in arithmetic. In: Fermüller, C., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 610–624. Springer, Heidelberg (2010)

    Google Scholar 

  23. Ternovska, E., Mitchell, D.: Declarative programming of search problems with built-in arithmetic. In: 21st International Joint Conference on Artificial Intelligence, IJCAI 2009 (2009)

    Google Scholar 

  24. Trahtenbrot, B.: The impossibility of an algorithm for the decision problem for finite domains. Doklady Academii Nauk SSSR 70, 569–572 (1950) (in Russian)

    Google Scholar 

  25. Vardi, M.Y.: The complexity of relational query languages. In: Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 137–146 (1982)

    Google Scholar 

  26. Vardi, M.Y.: On the complexity of bounded-variable queries. In: Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1995), pp. 266–276 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolokolova, A., Liu, Y., Mitchell, D., Ternovska, E. (2010). On the Complexity of Model Expansion . In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16242-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16241-1

  • Online ISBN: 978-3-642-16242-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics