Results 1 
7 of
7
AgentOriented Integration of Distributed Mathematical Services
 Journal of Universal Computer Science
, 1999
"... Realworld applications of automated theorem proving require modern software environments that enable modularisation, networked interoperability, robustness, and scalability. These requirements are met by the AgentOriented Programming paradigm of Distributed Artificial Intelligence. We argue that ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
Realworld applications of automated theorem proving require modern software environments that enable modularisation, networked interoperability, robustness, and scalability. These requirements are met by the AgentOriented 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...
LΩUI: Lovely ΩMEGA User Interface
, 2001
"... The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the
A Pragmatic Approach to Extending Provers by Computer Algebra  with Applications to Coding Theory
 FUNDAMENTA INFORMATICAE
, 1999
"... 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 nontrivial algorithms from computer algebra and increase ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
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 nontrivial 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 tacticlevel of Isabelle and its integration in...
Communication Protocols for Mathematical Services based on KQML and OMRS
, 2000
"... . 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 se ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
. 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...
An Implementation of Distributed Mathematical Services
, 1998
"... Realworld applications of theorem proving require open and modern software environments that enable modularization, distribution, interoperability, networking, and coordination. This paper describes the DMS architecture for automated theorem proving that connects a widerange of mathematical servi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Realworld applications of theorem proving require open and modern software environments that enable modularization, distribution, interoperability, networking, and coordination. This paper describes the DMS architecture for automated theorem proving that connects a widerange of mathematical services by a common, mathematical software bus. It also presents an implementation, OzDMS, of the architecture in the Oz programming language. OzDMS provides the functionality to turn existing theorem proving systems and tools into mathematical services that are homogeneously integrated into a networked proof development environment. The environment thus gains the services from these particular modules, but each module in turn gains from using the features of other, pluggedin components. 1 Introduction The work reported in this paper originates in the effort to develop a practical mathematical assistant system that integrates external deductive components. The\Omega megasystem [BCF + 97...
LOmegaUI: Lovely OMEGA User Interface
, 2001
"... The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. ..."
Abstract
 Add to MetaCart
The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems.
LΩUI: Lovely ΩMEGA . . .
, 1999
"... The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the multimodal interface that combines several features: a graphical display of information in a proof graph, a selective term browser with hypertext facilities, pr ..."
Abstract
 Add to MetaCart
The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the multimodal 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 agentbased clientserver architecture and implemented in the concurrent constraint programming language Oz.