Connection Calculus Theorem Proving with Multiple Built-in Theories

Journal of Symbolic Computation

Volumn 29, Issue 2, 2000, Pages 373-392

  Petermann, Uwe ^a  

^a LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012518318     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0365     Document Type: Article

References (32)

1. Baader F., Schulz K. U. Unification theory. Bibel W., Schmitt P. H. Automated Deduction. A Basis for Applications, volume I, chapter 7. 1998;225-263 Kluwer, Dordrecht.
2. thInternational Conference on Automated Deduction, Townsville, Australia, LNCS. 1997;19-43.
3. Bachmair L., Ganzinger H. Equational reasoning. Bibel W., Schmitt P. H. Automated Deduction. A Basis for Applications, volume I, chapter 11. 1998;353-397 Kluwer, Dordrecht.
4. P. Baumgartner, Proceedings of the GWAI 92, Ohlbach, H. J. 1992.
5. Baumgartner P., Petermann U. Theory reasoning. Bibel W., Schmitt P. H. Automated Deduction. A Basis for Applications, volume I, chapter 6. 1998;191-224 Kluwer, Dordrecht.
6. P. Baumgartner, F. Stolzenburg, Proceedings of the Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Baumgartner, P.Hähnle, R.Posegga, J. 1995, Springer, Berlin, 201, 216.
7. Bibel W. Automated Theorem Proving. 1982;Vieweg Verlag, Braunschweig.
8. Bürckert H.-J. A resolution principle for constrained logics. Artif. Intell. 66:1994;235-271.
9. Debart F., Enjalbert P., Lescot M. Multimodal logic programming using equational and order-sorted logic. Theor. Comput. Sci. 105:1992;141-166.
10. Fitting M. C. First-order Logic and Automated Theorem Proving. 1996;Springer, Berlin.
11. Frisch A. M. The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artif. Intell. 49:1991;161-198.
12. A. M. Frisch, C. D. Page Jr. Proceedings of the 14th International Joint Conference on Artificial Intelligence, Mellish, C. S. 1995, Morgan Kaufmann, Montreal, 1210, 1216.
13. A. M. Frisch, R. B. Scherl, Principles of Knowledge Representation and Reasoning, Proceedings of KR'91, Allen, J.Fikes, R.Sandewell, E. 1991, Morgan Kaufmann, Montreal.
14. Kripke S. Semantical analysis of modal logic I, normal propositional calculi. Z. Math. Logik Grundlagen Math. 9:1963;67-96.
15. Announced in J. Symb. Comput. Logic. 24:1959;323.
16. Loveland D. Automated Theorem Proving - A Logical Basis. 1978;Amsterdam, North Holland.
17. D. A. Miller, 1983.
18. Murray N., Rosenthal E. Theory links: applications to automated theorem proving. J. Symb. Comput. 1987;173-190.
19. G. Neugebauer.
20. G. Neugebauer, U. Petermann, Proceedings of the Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Baumgartner, P.Hähnle, R.Posegga, J. 1995, Springer, Berlin, 185, 200.
21. Neugebauer G., Petermann U. Specifications of inference rules: Extensions of the PTTP-technique. Bibel W., Schmitt P. H. Automated Deduction. A Basis for Applications, volume II, chapter 7. 1998;167-188 Kluwer, Dordrecht.
22. G. Neugebauer, T. Schaub, Proceedings of 3rd Turkish Symposium on Artificial Intelligence and Neural Networks, Bozsahin, C.Halici, U.Oflazar, K.Yalabik, N. 1994, Middle East Technical University Press, 297, 306.
23. Ohlbach H. J., Schmidt R. Functional translation and second-order frame properties of modal logics. J. Logic Comput. 7:1997;581-603.
24. U. Petermann, Logic in Artificial Intelligence, European Workshop, JELIA 90, van Eijck, J. 1990, Springer, Berlin, 444, 453.
25. Petermann U. How to build-in an open theory into connection calculi. J. Comput. Artif. Intell. 11:1992;105-142.
26. Petermann U. Completeness of the pool calculus with an open built in theory. Gottlob G., Leitsch A., Mundici D. 3rd Kurt Gödel Colloquium '93. 1993a;Springer, Berlin.
27. U. Petermann, 1993b.
28. U. Petermann, Proceedings of the Workshop on Theorem Proving with Analytic Tableaux and Related Methods - Short Papers, 1996.
29. U. Petermann, Proceedings of the Workshop on First-order Theorem Proving. Research Institute for Symbolic Computation, 1997.
30. Z. Rigó, 1995.
31. Stickel M. E. Automated deduction by theory resolution. J. Autom. Reasoning. 4:1985;333-356.
32. Tinelli C., Harandi M. Constraint logic programming over unions of constraint theories. 1996;. p. 436-450.