Real-world applications of automated theorem proving require modern software environments that enable modularisation, networked inter-operability, robustness, and scalability. These requirements are met by the Agent-Oriented Programming paradigm of Distributed Artificial Intelligence. We argue that a reasonable framework for automated theorem proving in the large regards typical mathematical services as autonomous agents that provide internal functionality to the outside and that, in turn, are able to access a variety of existing external services. This article describes...

The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the

The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, that supports this claim: the mechanised proofs depend on non-trivial algorithms from computer algebra and increase the reasoning power of the theorem prover. The unsoundness of computer algebra systems is a major problem in interfacing them to theorem provers. Our approach to obtaining a sound overall system is not blanket distrust but based on the distinction between algorithms we call sound and ad hoc respectively. This distinction is blurred in most computer algebra systems. Our experimental interface therefore uses a computer algebra library. It is based on formal specifications for the algorithms, and links the computer algebra library Sumit to the prover Isabelle. We give details of the interface, the use of the computer algebra system on the tactic-level of Isabelle and its integration in...

. In this paper we describe the rst ideas for formalizing a communication protocol for mathematical services based on Kqml (Knowledge Query and Manipulation Language) and OMRS (Open Mechanized Reasoning Systems). The claim is that the interaction level of a communication protocol for mathematical services can be relatively generic (hence Kqml suces), as long as the ontology of the computational behavior and internal state of the mathematical services is suciently expressive and concise (which we have in OMRS). The material presented in this paper is a rst exploratory step towards the denition of the interaction level in OMRS, supplies a concrete syntax based on the OpenMath standard, and gives a semantics to communication of mathematical services in distributed theorem proving and symbolic computation environments. 1 Introduction It is plausible to expect that the way we do (conceive, develop, communicate about, and publish) mathematics will change considerably in the next ten ye...

The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems.

The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the multi-modal interface that combines several features: a graphical display of information in a proof graph, a selective term browser with hypertext facilities, proof and proof plan presentation in natural language, and an editor for adding and maintaining the knowledge base. LΩUI is realized in an agent-based client-server architecture and implemented in the concurrent constraint programming language Oz.