Skip to main content
SpringerLink
Log in

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

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

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3835))

Abstract

We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.

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. Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of predicate logic. journal version in: J. Philos. Logic 27(3), 217–274 (1998) ILLC Research Report ML-1996-03 University of Amsterdam

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. van Benthem, J.: Dynamics bits and pieces, ILLC Research Report LP-97-01 University of Amsterdam

    Google Scholar 

  4. Marx, M.: Tolerance logic. Journal of Logic, Language and Information 10(3), 353–374 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grädel, E.: Decision procedures for guarded logics, in: 16th International Conference in Artificial Intelligence, Vol. In: Ohsuga, S., Raś, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 31–51. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Hodkinson, I.: Loosely guarded fragment of first-order logic has the finite model property. Studia Logica 70, 205–240 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hodkinson, I., Otto, M.: Finite conformal hypergraph covers, with two applications. Bull. Symbolic Logic 9, 387–405 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  9. Ganzinger, H., Meyer, C., Veanes, M.: The two-variable guarded fragment with transitive relations. In: Fourteenth Annual IEEE Symposium on Logic in Computer Science, pp. 24–34 (1999)

    Google Scholar 

  10. Szwast, W., Tendera, L.: On the decision problem for the guarded fragment with transitivity. In: Proc. 16th IEEE Symposium on Logic in Computer Science, pp. 147–156 (2001)

    Google Scholar 

  11. Kieroński, E.: The two-variable guarded fragment with transitive guards is 2EXPTIME-hard. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 299–312. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Bojańczyk, M.: Two-way alternating automata and finite models. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 833–844. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. De Giacomo, G., Lenzerini, M.: Tbox and Abox reasoning in expressive description logics. In: Proc. of KR 1996, pp. 316–327. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

  14. Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 60–74. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Pacholski, L., Szwast, W., Tendera, L.: Complexity results for first-order two-variable logic with counting. SIAM J. of Computing 25, 1083–1117 (2000)

    Article  MathSciNet  Google Scholar 

  16. Pratt-Hartmann, I.: Complexity of the two-variable fragment with (binary-coded) counting quantifiers. Journal of Logic, Language and Information (to appear)

    Google Scholar 

  17. Szwast, W., Tendera, L.: The guarded fragment with transitive guards. Annals of Pure and Applied Logic 128, 227–276 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Opole University, Poland

    Wiesław Szwast & Lidia Tendera

Authors
  1. Wiesław Szwast
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lidia Tendera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Miami, USA

    Geoff Sutcliffe

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szwast, W., Tendera, L. (2005). On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. In: Sutcliffe, G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11591191_22

Download citation

  • DOI: https://doi.org/10.1007/11591191_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31650-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation