Skip to main content
SpringerLink
Log in

Universal Structures and the Logic of Forbidden Patterns

  • Conference paper
Computer Science Logic (CSL 2006)

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

Included in the following conference series:

Abstract

Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input belongs to a proper minor closed class, a FPP becomes a CSP. This result can also be rephrased in terms of expressiveness of the logic MMSNP, introduced by Feder and Vardi in relation with CSPs. Our proof generalises that of a recent paper by Nešetřil and Ossona de Mendez. Note that our result holds in the general setting of problems over arbitrary relational structures (not just for graphs).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford University Press, Oxford (2004)

    Book  MATH  Google Scholar 

  2. Madelaine, F., Stewart, I.A.: Constraint satisfaction, logic and forbidden patterns (submitted, 2005)

    Google Scholar 

  3. Nešetřil, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combin. Theory Ser. B 80, 80–97 (2000)

    Article  MATH  Google Scholar 

  4. Dreyer Jr., P.A., Malon, C., Nešetřil, J.: Universal H-colourable graphs without a given configuration. Discrete Mathematics 250(1-3), 245–252 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Häggkvist, R., Hell, P.: Universality of A-mote graphs. European Journal of Combinatorics 14, 23–27 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dantchev, S.S., Madelaine, F.: Bounded-degree forbidden-pattern problems are constraint satisfaction problems. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 159–170. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Nešetřil, J., de Mendez, p.O.: Tree-depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics (2005)

    Google Scholar 

  8. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28, 57–104 (1999)

    Article  MathSciNet  Google Scholar 

  9. Kun, G.: Constraints, MMSNP and expander structures (manuscript, 2006)

    Google Scholar 

  10. Schaefer, T.J.: The complexity of satisfiability problems. In: STOC (1978)

    Google Scholar 

  11. Nesetril, J., Hell, P.: On the complexity of H-coloring. J. Combin. Theory Ser. B 48 (1990)

    Google Scholar 

  12. Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: FOCS (2002)

    Google Scholar 

  13. Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3) (2005)

    Google Scholar 

  14. Madelaine, F., Stewart, I.A.: Some problems not definable using structures homomorphisms. Ars Combinatoria LXVII (2003)

    Google Scholar 

  15. Bodirsky, M.: Constraint Satisfaction with Infinite Domains. PhD thesis, Humboldt-Universität zu Berlin (2004)

    Google Scholar 

  16. Bodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 646–659. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Madelaine, F.: Constraint satisfaction problems and related logic. PhD thesis, University of Leicester, Department of Mathematics and Computer Science (2003)

    Google Scholar 

  18. Fraïssé, R.: Sur l’extension aux relations de quelques propriétés des ordres. Ann. Sci. Ecole Norm. Sup. 71(3), 363–388 (1954)

    MATH  MathSciNet  Google Scholar 

  19. Courcelle, B.: The monadic second order logic of graphs VI: On several representations of graphs by relational structures. Discrete Applied Mathematics 54, 117–149 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. DeVos, M., Ding, G., Oporowski, B., Sanders, D.P., Reed, B., Seymour, P., Vertigan, D.: Excluding any graph as a minor allows a low tree-width 2-coloring. J. Combin. Theory Ser. B 91(1), 25–41 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Madelaine, F.: Online appendix of this paper electronic form (2006), available from: www.dur.ac.uk/f.r.madelaine

  22. Achlioptas, D.: The complexity of G-free colourability. Discrete Mathematics, 21–30, 165–166 (1997)

    Google Scholar 

  23. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  24. Bodirsky, M., Nešetřil, j.: Constraint satisfaction with countable homogeneous templates. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 44–57. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Cherlin, G., Shelah, S., Shi, N.: Universal graphs with forbidden subgraphs and algebraic closure. Adv. in Appl. Math. 22(4), 454–491 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  26. Courcelle, B.: The monadic second-order logic of graphs. XIV. Uniformly sparse graphs and edge set quantifications. Theoret. Comput. Sci. 299(1-3), 1–36 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  27. Nešetřil, J., de Mendez, P.O.: Grad and classes with bounded expansion iii. restricted dualities. Technical Report 2005-741, KAM-DIMATIA (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Durham, Science Labs, South Road, Durham, DH1 3LE, U.K.

    Florent Madelaine

Authors
  1. Florent Madelaine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madelaine, F. (2006). Universal Structures and the Logic of Forbidden Patterns. In: Ésik, Z. (eds) Computer Science Logic. CSL 2006. Lecture Notes in Computer Science, vol 4207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11874683_31

Download citation

  • DOI: https://doi.org/10.1007/11874683_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45458-8

  • Online ISBN: 978-3-540-45459-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation