Skip to main content
SpringerLink
Log in

A Comprehensive Framework for Combined Decision Procedures

  • Conference paper
Frontiers of Combining Systems (FroCoS 2005)

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

Included in the following conference series:

Abstract

We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen schema. The procedure is in general only sound, but it becomes terminating and complete when the shared fragment enjoys suitable noetherianity conditions and allows an abstract version of a ‘Keisler-Shelah like’ isomorphism theorem. We show that this general decidability transfer result covers as special cases, besides applications which seem to be new, the recent extension of Nelson-Oppen procedure to non-disjoint signatures [16] and the fusion transfer of decidability of consistency of A-Boxes with respect to T-Boxes axioms in local abstract description systems [9]; in addition, it reduces decidability of modal and temporal monodic fragments [32] to their extensional and one-variable components.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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., Nemeti, I., VanBenthem, J.: Modal languages and bounded fragments of predicate logics. Journal of Philosophical Logic 27, 217–274 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Andrews, P.B.: An introduction to mathematical logic and type theory: to truth through proof. Applied Logic Series, vol. 27. Kluwer Acad. Publ., Dordrecht (2002)

    MATH  Google Scholar 

  3. Andrews, P.B.: Classical type theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, pp. 966–1007. Elsevier/MIT, Cambridge (2001)

    Google Scholar 

  4. Baader, F., Ghilardi, S.: Connecting many-sorted theories. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 278–294. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Baader, F., Ghilardi, S.: Connecting many-sorted structures and theories through adjoint functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS, vol. 3717, pp. 31–47. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  7. Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Information and Computation 178(2), 346–390 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Baader, F., Ghilardi, S., Tinelli, C.: A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Information and Computation (to appear)

    Google Scholar 

  9. Baader, F., Lutz, C., Sturm, H., Wolter, F.: Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research 16, 1–58 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Börger, E., Grädel, E., Gurevich, Y.: The classical decision problem. Universitext. Springer, Berlin (2001)

    MATH  Google Scholar 

  11. Chang, C.-C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)

    MATH  Google Scholar 

  12. Dowek, G.: Higher order unification and matching. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, pp. 1009–1062. Elsevier/MIT, Cambridge (2001)

    Chapter  Google Scholar 

  13. Fermüller, C., Tammet, T., Leitsch, A., Zamov, N.: Resolution Methods for the Decision Problem. LNCS, vol. 679. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  14. Gabbay, D.M., Shehtman, V.B.: Undecidability of modal and intermediate first-order logics with two individual variables. Journal of Symbolic Logic 58, 800–823 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Studies in Logic and the Foundations of Mathematics, vol. 148. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  16. Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-3), 221–249 (2005)

    MathSciNet  Google Scholar 

  17. Ghilardi, S., Nicolini, E., Zucchelli, D.: A comprehensive framework for combined decision procedures. Technical Report 304-05, Dipartimento di Scienze dellInformazione, Università degli Studi di Milano (2005), http://homes.dsi.unimi.it/~ghilardi/allegati/frocos05.zip

  18. Grädel, E.: Decision procedures for guarded logics. In: Ganzinger, H. (ed.) CADE 1999. LNCS, vol. 1632, pp. 31–51. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Kontchakov, R., Kurucz, A., Zakharyaschev, M.: Undecidability of first-order intuituionistic and modal logics with two variables (2004) (manuscript)

    Google Scholar 

  20. Kripke, S.: The undecidability of monadic modal quantificational theory. Z. Math. Logik Grundlag. Math. 8, 113–116 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lambek, J., Scott, P.J.: Introduction to higher order categorical logic. Cambridge Studies in Advanced Mathematics, vol. 7

    Google Scholar 

  22. Löwhenheim, L.: Über Möglichkeiten im Relativkalkül. Math. Annalen 76, 228–251 (1915)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  24. Mortimer, M.: On languages with two variables. Z. Math. Logik Grundlag. Math. 21, 135–140 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  25. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems 1(2), 245–257 (1979)

    Article  MATH  Google Scholar 

  26. Oppen, D.C.: Complexity, convexity and combinations of theories. Theoretical Computer Science 12, 291–302 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  27. Scott, D.: A decision method for for validity of sentences in two variables. Journal of Symbolic Logic 27, 477 (1962)

    Google Scholar 

  28. Segerberg, K.: Two-dimensional modal logic. Journal of Philosophical Logic 2, 77–96 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  29. Shehtman, V.B.: On some two-dimensional modal logics. In: 8th Congress on Logic Methodology and Philosophy of Science, Nauka, Moskow, vol. 1, pp. 326–330 (1987)

    Google Scholar 

  30. Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning 30(1), 1–31 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  31. Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson–Oppen combination procedure. In: Proc. of the 1st Int. Workshop on Frontiers of Combining Systems, pp. 103–120. Kluwer Acad. Publ., Dordrecht (1996)

    Google Scholar 

  32. Wolter, F., Zakharyaschev, M.: Decidable fragments of first-order modal logics. Journal of Symbolic Logic 66, 1415–1438 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  33. Wolter, F.: Fusions of modal logics revisited. In: Kracht, M., de Rijke, M., Wansing, H., Zakharyaschev, M. (eds.) Advances in Modal Logic. CSLI, Stanford (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione,  

    Silvio Ghilardi & Daniele Zucchelli

  2. Dipartimento di Matematica, Università degli Studi di Milano, Italy

    Enrica Nicolini

Authors
  1. Silvio Ghilardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrica Nicolini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniele Zucchelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Informatik, Technische Universität Wien, Favoritenstr. 9 – E185/2, A-1040, Wien, Austria

    Bernhard Gramlich

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghilardi, S., Nicolini, E., Zucchelli, D. (2005). A Comprehensive Framework for Combined Decision Procedures. In: Gramlich, B. (eds) Frontiers of Combining Systems. FroCoS 2005. Lecture Notes in Computer Science(), vol 3717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559306_1

Download citation

  • DOI: https://doi.org/10.1007/11559306_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29051-3

  • Online ISBN: 978-3-540-31730-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation