Agent-oriented integration of distributed mathematical services

Journal of Universal Computer Science

Volumn 5, Issue 3, 1999, Pages 156-187

  Franke, Andreas ^a   Hess, Stephan M ^a   Jung, Christoph G ^b   Kohlhase, Michael ^a   Sorge, Volker ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001536634     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (71)

1. [Abbot et al., 1996] J. Abbot, A. v. Leeuwen, and A. Strotmann. Objectives of Open-Math. Technical Report 12, RIACA, Technische Universiteit Eindhoven, 1996.
2. [Andrews et al., 1996] P. B. Andrews, M. Bishop, S. Issar, D. Nesmith, F. Pfenning, and H. Xi. TPS: A Theorem Proving System for Classical Type Theory. Journal of Automated Reasoning, 16(3):321-353, 1996.
3. [Andrews, 1986] P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
4. [Ballarin et al., 1995] C. Ballarin, K. Homann, and J. Calmet. Theorems and Algorithms: An Interface between Isabelle and Maple. In A. Levelt, editor, Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC'95), pp. 150-157. ACM Press, 1995.
5. [Benzmüller and Kohlhase, 1998] C. Benzmüller and M. Kohlhase. LEO - a Higher Order Theorem Prover. In Kirchner and Kirchner [1998], pp. 139-144.
6. [Benzmüller and Sorge, 1998] C. Benzmüller and V. Sorge. Integrating TPS with ΩMEGA. In J. Grundy and M. Newey, editors, Theorem Proving in Higher Order Logics: Emerging Trends, Technical Report 98-08, Department of Computer Science, pp. 1-19, Canberra, Australia, 1998. The Australian National University, available from http : //cs. anu.edu. au/techreports/recent.html.
7. [Benzmüller et al., 1997] C. Benzmüller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, E. Melis, A. Meier, W. Schaarschmidt, J. Siekmann, and V. Sorge. ΩMEGA: Towards a Mathematical Assistant. In McCune [1997], pp. 252-255.
8. [Boyer and Moore, 1979] R. S. Boyer and J S. Moore. A Computational Logic. Academic Press, New York, 1979.
9. [Bray, 1997] Extensible Markup Language (XML). W3C Recommendation PR-xml971208, W3 Consortium, 1997. Available at http://www.w3.org/TR/PR-xml.html.
10. [Calmet and Homann, 1997] J. Calmet and K. Homann. Towards the Mathematical Software Bus. Journal of Theoretical Computer Science, 187(1-2):221-230, 1997.
11. [Caprotti, 1998] Draft of the open math standard. Open Math Consortium, http: //www.nag.co.uk/projects/OpenMath/omstd/, 1998.
12. [Cheikhrouhou and Sorge, 1998] L. Cheikhrouhou and V. Sorge. Planning Equivalence Proofs. In Denzinger et al. [1998], pp. 13-22.
13. [Clarke and Zhao, 1992] E. Clarke and X. Zhao. Analytica-A Theorem Prover in Mathematica. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, pp. 761-763. Springer, Berlin, 1992.
14. [D. Fuchs, 1997] J. Denzinger D. Fuchs. Knowledge-based Cooperation between Theorem Provers by TECHS. Seki Report SR-97-11, Fachbereich Informatik, Universität Kaiserslautern, 1997.
15. [Dann, 1997] I. Dahn. Integration of Automated and Interactive Theorem Proving in ILF. In McCune [1997], pp. 57-60.
16. [Denzinger and Dahn, 1998] Jörg Denzinger and Ingo Dahn. Cooperating theorem provers. In Wolfgang Bibel and Peter Schmitt, editors, Automated Deduction - A Basis for Applications, volume 2, pp. 483-416. Kluwer, 1998.
17. [Denzinger et al., 1997] J. Denzinger, J. Kronenburg, and S. Schulz. DISCOUNT A distributed and learning equational prover. Journal of Automated Reasoning, 18(2):189-198, 1997.
18. [Denzinger et al., 1998] J. Denzinger, M. Kohlhase, and B. Spencer, editors. CADE15 Workshop "Using AI Methods in Deduction", 1998.
19. [Denzinger, 1993] J. Denzinger. Teamwork: A method to design distributed knowledge based theorem provers. PhD thesis, Universität Kaiserslautern, 7993. (in german).
20. [DIN ISO 7498, 1982] Informationsverarbeitung DIN ISO 7498. Kommunikation Offener Systeme, Basis-Referenzmodell, 1982.
21. [Felty and Howe, 1997] A. P. Felty and D. J. Howe. Hybrid Interactive Theorem Proving Using Nuprl and HOL. In McCune [1997], pp. 351-365.
22. [Finin and Fritzson, 1994] T. Finin and R. Fritzson. KQML - A Language and Protocol for Knowledge and Information Exchange. In Proceedings of the 13th Intl. Distributed AI Workshop, pp. 127-136, Seattle, 1994.
23. [Fisher and Ireland, 1998] M. Fisher and A. Ireland. Multi-Agent Proof-Planning. In Denzinger et al. [1998], pp. 33-42.
24. [Fisher, 1997] M. Fisher. An Open Approach to Concurrent Theorem Proving. In J. Geller, H. Kitano, and C. Suttner, editors, Parallel Processing for Artificial Intelligence, volume 3. Elsevier/North Holland, 1997.
25. [Genesereth and et al., 1992] M. Genesereth and R. Fikes et al. Knowledge Interchange Format: Version 3.0 Reference Manual. Technical report, Computer Science Department, Stanford University, 1992.
26. [Gentzen, 1935] G. Gentzen. Untersuchungen über das logische Schließen I & II. Mathematische Zeitschrift, 39:176-210, 572-595, 1935.
27. [Gerber and Jung, 1998] C. Gerber and C. G. Jung. Resource management for boundedly optimal agent societies. In Proceedings of the ECAI'98 Workshop on Monitoring and Control of Real-Time Intelligent Systems, pp. 23-28, 1998.
28. [Giunchiglia et al., 1996] F. Giunchiglia, P. Pecchiari, and C. Talcott. Reasoning Theories - Towards an Architecture for Open Mechanized Reasoning Systems. In F. Baader and K. Schulz, editors, Frontiers of combining systems, volume 3 of Applied logic series, pp. 157-174. Kluwer Academic Publishers, Dordrecht, 1996.
29. [Good, 1976] I. J. Good. Good Thinking. University of Minnesota Press, Minneapolis, 1976.
30. [Hähnle et al., 1996] R. Hähnle, M. Kerber, and C. Weidenbach. Common Syntax of DFG-Schwerpunktprogramm "Deduktion". Internal Report 10/96, Universität Karlsruhe, Fakultät für Informatik, 1996.
31. [Hall, 1959] M. Hall. The Theory of Groups. The Macmillan Company, New York, 1959.
32. [Harrison and Théry, 1993] J. Harrison and L. Théry. Reasoning About the Reals: The Marriage of HOL and Maple. In A. Voronkov, editor, Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning (LPAR'93), volume 698 of LNAI, pp. 351-353. Springer, Berlin, 1993.
33. [Hess et al., 1998] S. Hess, Ch. Jung, M. Kohlhase, and V. Sorge. An Implementation of Distributed Mathematical Services. In 6th CALCULEMUS and TYPES Workshop, Eindhoven, 1998. Electronic Proceedings http://www.win.tue.nl/math/dw/ pp/calc/proceedings.html.
34. [Homann and Calmet, 1995] K. Homann and J. Calmet. An Open Environment for Doing Mathematics. In M. Wester, S. Steinberg, and M. Jahn, editors, Proceedings of Ist International IMACS Conference on Applications of Computer Algebra, Albuquerque, 1995.
35. [Homann and Calmet, 1996] K. Homann and J. Calmet. Structures for Symbolic Mathematical Reasoning and Computation. In J. Calmet and C. Limogelli, editors, Design and Implementation of Symbolic Computation Systems, DISCO'96, no. 1128 in LNCS, pp. 216-227. Springer, Berlin, 1996.
36. [Homann, 1996] K. Homann. Symbolisches Lösen mathematischer Probleme durch Kooperation algorithmischer und logischer Systeme. PhD thesis, Unversität Karlsruhe, 1996. DISKI 152, Infix; St. Augustin.
37. [Huang and Fiedler, 1996] X. Huang and A. Fiedler. Presenting Machine-Found Proofs. In McRobbie and Slaney [1996], pp. 221-225.
38. [Huet and Lang, 1978] G. Huet and B. Lang. Proving and applying Program Transformations expressed with Second Order Logic. Acta Informatica, 11:31-55, 1978.
39. [Hutter and Sengler, 1996] Dieter Hutter and Claus Sengler. INKA - The Next Generation. In McRobbie and Slaney [1996], pp. 288-292.
40. [Hutter et al., 1996] D. Hutter, B. Langenstein, C. Sengler, J. Siekmann, W. Stephan, and A. Wolpers. Verification Support Environment. High Integrity Systems, 1(6), 1996.
41. [Ion, 1998] Mathematical Markup Language (MathML) 1.0 specification. W3C Recommendation REC-MathML-19980407, W3 Consortium, 1998. Available at http: //www.w3.org/TR/REC-MathML/.
42. [ISO, 1995] Information technology - Programming languages - Prolog - Part 1: General core, 1995.
43. [Kerber et al., 1998] M. Kerber, M. Kohlhase, and V. Sorge. Integrating Computer Algebra Into Proof Planning. Journal of Automated Reasoning, 21(3):327-355, 1998.
44. [Kerber, 1991] M. Kerber. How to Prove Higher Order Theorems in First Order Logic. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI), pp. 137-142. Morgan Kaufmann, San Mateo, 1991.
45. [Kirchner and Kirchner, 1998] C. Kirchner and H. Kirchner, editors. Proceedings of the 15th Conference on Automated Deduction, no. 1421 in LNAI. Springer, Berlin, 1998.
46. [McCune and Wos, 1997] W. McCune and L. Wos. Otter CADE-13 Competition Incarnations. Journal of Automated Reasoning, 18(2):211-220, 1997. Special Issue on the CADE-13 Automated Theorem Proving System Competition.
47. [McCune, 1997] W. McCune, editor. Proceedings of the 14th Conference on Automated Deduction, no. 1249 in LNAI. Springer, Berlin, 1997.
48. [McRobbie and Slaney, 1996] M. McRobbie and J. Slaney, editors. Proceedings of the 13th Conference on Automated Deduction, no. 1104 in LNAI. Springer, Berlin, 1996.
49. [Paulson, 1994] L. C. Paulson. Isabelle: A Generic Theorem Prover. LNCS. Springer, Berlin, 1994.
50. [Pfenning, 1987] F. Pfenning. Proof Transformations in Higher-Order Logic. PhD thesis, Carnegie-Mellon University, Pittsburgh Pa., 1987.
51. [Pitt, 1996] J. Pitt. A WWW Interface to a Theorem Prover for Modal Logic. In N. Merriam, editor, User Interfaces for Theorem Provers, pp. 83-90, Department of Computer Science, University of York, UK, 1996.
52. [Raggett, 1998] HTML 4.0 Specification. W3C Recommendation REC-html40-1998-0424, W3 Consortium, 1998. Available at http://www.w3.org/TR/PR-xml.html.
53. [Redfern, 1998] D. Redfern. The Maple Handbook: Maple V Release 5. Springer, Berlin, 1998.
54. [Richardson et al., 1998] J. Richardson, A. Smaill, and I. Green. System description: Proof planning in higher-order logic with Adam. In Kirchner and Kirchner [1998].
55. [Rudnicki, 1992] P. Rudnicki. An Overview of the MIZAR Project. In Proceedings of the 1992 Workshop on Types and Proofs as Programs, pp. 311-332, 1992.
56. [Russell and Norvig, 1995] S J. Russell and P. Norvig. Artificial Intelligence, A Modern Approach. Prentice Hall, 1995.
57. [Schmidt-Schauß, 1989] M. Schmidt-Schau. Computational Aspects of an Order-Sorted Logic with Term Declarations, volume 395 of LNAI. Springer, Berlin, 1989.
58. [Searle, 1969] J. R. Searle. Speech Acts. Cambridge University Press, 1969.
59. [Shoham, 1990] Y. Shoham. Agent-Oriented Programming. Technical report, Stanford University, 1990.
60. [Siegel, 1996] J. Siegel. Corba: Fundamentals and Programming. John Wiley & Sons, Inc., 1996.
61. [Siekmann et al., 1998] J. Siekmann, S. Hess, C. Benzmüller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, H. Horacek, M. Kohlhase, K. Konrad, A. Meier, E. Melis, and V. Sorge. A Distributed Graphical User Interface for the Interactive Proof System ΩMEGA. In R. Backhouse, editor, User Interfaces for Theorem Provers, no. 98-08 in Computing Science Reports, pp. 130-138, Department of Mathematics and Computing Science, Eindhoven Technical University, 1998.
62. [Simon, 1982] H.Simon. Models of Bounded Rationality. MIT Press, Cambridge, 1982.
63. [Slind et al., 1998] K. Slind, M. Gordon, R. Boulton, and A. Bundy. An Interface between CLAM and HOL. In Kirchner and Kirchner [1998], pp. 129-133.
64. [Smith, 1980] R.G. Smith. The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. In IEEE Transaction on Computers, no. 12 in C-29, pp. 1104-1113, 1980.
65. [Smolka, 1995] G. Smolka. The Oz Programming Model. In J. v. Leeuwen, editor, Computer Science Today, volume 1000 of LNCS, pp. 324-343. Springer, Berlin, 1995.
66. [Steiner, 1992] D. Steiner. MEKKA: Eine Entwicklungsumgebung zur Konstruktion kooperativer Anwendungen. In J. Müller and D. Steiner, editors, Kooperierende Agenten, no. D-92-24 in DFKI Document, pp. 17-21. DFKI, Saarbrü1992.
67. [Steiner, 1997] D. Steiner. An Overview of FIPA'97, 1997. Available at http:// drogo.cselt.stet.it/fipa/fipapresl.zip.
68. [Sutcliffe and Suttner, 1997] G. Sutcliffe and C. Suttner. The Results of the CADE-13 ATP System Competition. Journal of Automated Reasoning, 18(2):259-264, 1997.
69. [Thompson, 1991] S. Thompson. Type Theory and Functional Programming. International Computer Science Series. Addison Wesley, 1991.
70. [Weidenbach, 1997] C. Weidenbach. SPASS: Version 0.49. Journal of Automated Reasoning, 18(2):247-252, 1997. Special Issue on the CADE-13 Automated Theorem Proving System Competition.
71. [Wooldridge and Jennings, 1995] M. Wooldridge and N. Jennings. Intelligent Agents: Theory and Practice. Knowledge Engineering Review, 10(2), 1995.