Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andrews, P.: Theorem Proving via General Matings. J.ACM 28 (1981) 193–214
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
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
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
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)
Bibel, W.: Matings in matrices. In Siekmann, J., ed.: German Workshop on Artificial Intelligence, Berlin, Springer (1981) 171–187
Bibel, W.: Automated Theorem Proving. Vieweg Verlag, Braunschweig (1982)
Bürckert, H.J.: A resolution principle for constrained logics. Artificial Intelligence 66 (1994) 235–271
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)
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
Loveland, D.W.: Automated Theorem Proving: a Logical Basis. 1 edn. North-Holland, Amsterdam (1978)
Miller, D.A.: Proofs in Higher-Order Logic. PhD thesis, Carnegie Mellon University, Pittsburg Pa. (1983)
Murray, N., Rosenthal, E.: Theory Links: Applications to Automated Theorem Proving. J. of Symbolic Computation (1987) 173–190
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)
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
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
Petermann, U.: How to Build-in an Open Theory into Connection Calculi. Journal on Computer and Artificial Intelligence 11 (1992) 105–142
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)
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)
Stickel, M.E.: Automated deduction by theory resolution. Journal of Automated Reasoning 4 (1985) 333–356
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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