Advertisement

Abstract

This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules which can then be used to reason within the logic. The method guarantees that the generated rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filtration with respect to a well-defined first-order semantics then adding a general blocking mechanism produces a terminating tableau calculus. The process of generating tableau rules can be completely automated and produces, together with the blocking mechanism, an automated procedure for generating tableau decision procedures. For illustration we show the workability of the approach for propositional intuitionistic logic.

Keywords

Modal Logic Description Logic Intuitionistic Logic Predicate Symbol Ground Term 
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.
    Horrocks, I., Sattler, U.: A tableau decision procedure for SHOIQ. J. Automat. Reasoning 39(3), 249–276 (2007)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Hustadt, U., Tishkovsky, D., Wolter, F., Zakharyaschev, M.: Automated reasoning about metric and topology (System description). In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS(LNAI), vol. 4160, pp. 490–493. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Kripke, S.A.: Semantical analysis of intuitionistic logic I. In: Formal Systems and Recursive Functions, pp. 92–130. North-Holland, Amsterdam (1965)CrossRefGoogle Scholar
  4. 4.
    Schmidt, R.A.: Developing modal tableaux and resolution methods via first-order resolution. In: Advances in Modal Logic, vol. 6, pp. 1–26. College Publ. (2006)Google Scholar
  5. 5.
    Schmidt, R.A., Tishkovsky, D.: Using tableau to decide expressive description logics with role negation. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 438–451. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Schmidt, R.A., Tishkovsky, D.: A general tableau method for deciding description logics, modal logics and related first-order fragments. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS, vol. 5195, pp. 194–209. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Schmidt, R.A., Tishkovsky, D.: Automated synthesis of tableau calculi (2009), http://www.cs.man.ac.uk/~dmitry/papers/astc2009.pdf
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Renate A. Schmidt
    • 1
  • Dmitry Tishkovsky
    • 1
  1. 1.School of Computer ScienceThe University of Manchester 

Personalised recommendations