Skip to main content
SpringerLink
Log in

A Confluent Theory Connection Calculus

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2002)

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

  • 245 Accesses

Abstract

In the present paper we combine two different enhancements of connection method based theorem proving calculi: a confluent version of a connection calculus [5] and a general approach for building-in theories [17] in connection calculi.

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. Andrews, P.: Theorem Proving via General Matings. J.ACM 28 (1981) 193–214

    Article  MATH  Google Scholar 

  2. Baader, F., Schulz, K.U.: Unification theory. In Bibel, W., Schmitt, P.H., eds.: Automated Deduction. A Basis for Applications. Volume I. Kluwer Academic Publishers Group, Dordrecht, The Netherlands (1998) 225–263

    Google Scholar 

  3. Bachmair, L., Ganzinger, H., Voronkov, A.: Elimination of equality via transformations with ordering constraints. In Kirchner, C., Kirchner, H., eds.: Proceedings, 15th International Conference on Automated Deduction (CADE), Lindau, Germany. Volume 1421 of Lecture Notes in Computer Science., Springer (1998) 175–190

    Chapter  Google Scholar 

  4. Baumgartner, P., Petermann, U.: Theory Reasoning. In Bibel, W., Schmitt, P.H., eds.: Automated Deduction. A Basis for Applications. Volume I. Kluwer Academic Publishers Group, Dordrecht, The Netherlands (1998) 191–224

    Google Scholar 

  5. Baumgartner, P., Eisinger, N., Furbach, U.: A confluent connection calculus. In Hölldobler, S., ed.: Intellectics and Computational Logic-Papers in Honor of Wolfgang Bibel. Kluwer (1999)

    Google Scholar 

  6. Bibel, W.: Matings in matrices. In Siekmann, J., ed.: German Workshop on Artificial Intelligence, Berlin, Springer (1981) 171–187

    Google Scholar 

  7. Bibel, W.: Automated Theorem Proving. Vieweg Verlag, Braunschweig (1982)

    MATH  Google Scholar 

  8. Bürckert, H.J.: A resolution principle for constrained logics. Artificial Intelligence 66 (1994) 235–271

    Article  MATH  MathSciNet  Google Scholar 

  9. Debart, F., Enjalbert, P.: A case of termination for associative unification. In H.Abdulrab, J.P., ed.: Words Equations and related Topics: Second International Workshop IWWERT’ 91, Berlin, Springer-Verlag (1992)

    Google Scholar 

  10. Frisch, A.M., Scherl, R.B.: A general framework for modal deduction. In Allen, J., Fikes, R., Sandewall, E., eds.: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, San Mateo, Morgan Kaufmann (1991) 196–207

    Google Scholar 

  11. Loveland, D.W.: Automated Theorem Proving: a Logical Basis. 1 edn. North-Holland, Amsterdam (1978)

    MATH  Google Scholar 

  12. Miller, D.A.: Proofs in Higher-Order Logic. PhD thesis, Carnegie Mellon University, Pittsburg Pa. (1983)

    Google Scholar 

  13. Murray, N., Rosenthal, E.: Theory Links: Applications to Automated Theorem Proving. J. of Symbolic Computation (1987) 173–190

    Google Scholar 

  14. Neugebauer, G., Petermann, U.: Specifications of inference rules and their automatic translation. In: Workshop on Theorem Proving with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science (1995)

    Google Scholar 

  15. Neugebauer, G., Schaub, T.: A pool-based connection calculus. In Bozşahin, C., Halıcı, U., Oflazar, K., Yalabík, N., eds.: Proceedings of Third Turkish Symposium on Artificial Intelligence and Neural Networks, Middle East Technical University Press (1994) 297–306

    Google Scholar 

  16. Ohlbach, H.J., Schmidt, R.A.: Functional translation and second-order frame properties of modal logics. Journal of Logic and Computation 7 (1997) 581–603

    Article  MATH  MathSciNet  Google Scholar 

  17. Petermann, U.: How to Build-in an Open Theory into Connection Calculi. Journal on Computer and Artificial Intelligence 11 (1992) 105–142

    MATH  MathSciNet  Google Scholar 

  18. Petermann, U.: Completeness of the pool calculus with an open built in theory. In Gottlob, G., Leitsch, A., Mundici, D., eds.: 3rd Kurt Gödel Colloquium’ 93. Volume 713 of Lecture Notes in Computer Science., Berlin, Springer-Verlag (1993)

    Google Scholar 

  19. Petermann, U.: Combining Semantical and Syntactical Theory Reasoning. In Gabbay, D.M., de Rijke, M., eds.: Frontiers of Combining Systems 2, FroCoS’98, Research Studies Press Limited (1999)

    Google Scholar 

  20. Stickel, M.E.: Automated deduction by theory resolution. Journal of Automated Reasoning 4 (1985) 333–356

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Leipzig University of Applied Sciences, D-04251, Leipzig, P.O.B. 300066, Germany

    Uwe Petermann

Authors
  1. Uwe Petermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung Wisssenbasierte Systeme 184/3, Technische Univesität Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Uwe Egly

  2. Institut für Computersprachen AG Theoretische Informatik und Logik 185.2, Technische Universität Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Chritian G. Fermüller

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petermann, U. (2002). A Confluent Theory Connection Calculus. In: Egly, U., Fermüller, C.G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2002. Lecture Notes in Computer Science(), vol 2381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45616-3_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45616-3_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43929-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation