System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving

@inproceedings{Franke1999SystemDM,
  title={System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving},
  author={Andreas Franke and Michael Kohlhase},
  booktitle={CADE},
  year={1999}
}
Real-world applications of theorem proving require open and modern software environments that enable modularization, distribution, inter-operability, networking, and coordination. This system description presents the MathWeb1 approach for distributed automated theorem proving that connects a wide-range of mathematical services by a common, mathematical software bus. The MathWeb system provides the functionality to turn existing theorem proving systems and tools into mathematical services that… 
View via Publisher
wikidata.org
52 Citations
Highly Influential Citations
4
Background Citations
6
Methods Citations
10

52 Citations

Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus

The integration of the ?Clam system, a reasoning specialist for proofs by induction, into the MathWeb-SB is described and first experiments on proving theorems by induction using the computational power of the Maple system within?Clam are described.

System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning

This chapter discusses automated theorem prover systems, which have reached a high degree of maturity in the last decade, but are seldom actually used by people other than their own developers.

Towards Interoperable Mechanized Reasoning Systems: the Logic Broker Architecture

This paper presents the Logic Broker Architecture, a framework which provides the needed infrastructure for making mechanized reasoning systems interoperate, and provides location transparency, a way to forward requests for logical services to appropriate reasoning systems, and a translation mechanism which ensures the transparent and provably sound exchange of logical services.

Ω mega – A Mathematical Assistant System

Classical automated theorem provers can prove non-trivial mathematical theorems in highly specific settings. However they are generally unable to cope with even moderately difficult theorems in…

Bridging Theorem Proving and Mathematical Knowledge Retrieval

An intermediate layer containing both, search and proving functionality can be used to mediate between the two and flexibly connect existing theorem proving systems into networked environments that contain large knowledge bases.

Plug-in Proof Support for Formal Development Environments

This paper describes a generic framework that supports the many-to-many connection of formal development environments and theorem provers, and an Intermediate Modelling Language (IML), which is used to connect the FDEs to the theoremProvers.

OMDOC: Towards an Internet Standard for the Administration, Distribution, and Teaching of Mathematical Knowledge

An extension OMDoc to the OPEN-MATH standard is presented that allows the representation of the semantics and structure of various kinds of mathematical documents, including articles, textbooks, interactive books, courses.

A systematic approach to connecting standalone theorem provers to formal development environments

  • D. Hemer
  • Computer Science, Mathematics
    2006 13th Asia Pacific Software Engineering Conference (APSEC'06)
  • 2006
A systematic approach to the development of translators from the intermediate representation to a target theorem prover representation by defining a variety of translation rules.

Integrating HOL-CASL into the Development Graph Manager MAYA

This work discusses the integration of HOL-CASL and MAYA into a powerful system providing tool support for CASL, which will also serve as a basis for the Integration of further proof tools.

Harnessing Disruptive Innovation in Formal Verification

  • J. Rushby
  • Computer Science
    Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)
  • 2006
This work describes two approaches to development and use of SMT solvers: these use techniques from theorem proving but apply them in ways that enable model checking, while also supporting highly automated theorem proving.
...

References

SHOWING 1-10 OF 15 REFERENCES

An Implementation of Distributed Mathematical Services

Oz-DMS provides the functionality to turn existing theorem proving systems and tools into mathematical services that are homogeneously integrated into a networked proof development environment.

Agent-Oriented Integration of Distributed Mathematical Services

This article describes theMathWeb architecture that encapsulates a wide range of traditional mathematical systems each into a social agent-shell and proposes a communication language based on the Knowledge Query and Manipulation Language (KQML) in order to allow conversations between these mathematical agents.

CORBA fundamentals and programming

This book discusses object-oriented analysis and design methods and compares available object request brokers and provides a fully-worked example with a single object implementation.

Presenting Machine-Found Proofs

This paper outlines an implemented system named PROVERB that transforms and abstracts machine-found proofs to natural deduction style proofs at an adequate level of abstraction and then verbalizes…

KQML - A Language and Protocol for Knowledge and Information Exchange

The design of and experimentation with the Knowledge Query and Manipulation Language (KQML) are described, a new language and protocol for exchanging information and knowledge aimed at developing techniques and methodology for building large-scale knowledge bases which are sharable and reusable.

Omega: Towards a Mathematical Assistant

Ωmega is a mixed-initiative system with the ultimate purpose of supporting theorem proving in main-stream mathematics and mathematics education. The current system consists of a proof planner and an…

ΩMEGA : Towards a mathematical assistant

ΩMEGA is a mixed-initiative system with the ultimate purpose of supporting theorem proving in main-stream mathematics and mathematics education. The current system consists of a proof planner and an…

A Distributed Graphical User Interface for the Interactive Proof System

CORBA Fundamentals and Programming

System Description: LEO - A Higher-Order Theorem Prover

Leo uses a higher-order Logic based upon Church's simply typed λ-calculus, so that the comprehension axioms are implicitly handled by αβη-equality, and extensionality principles are build in into Leo’s unification, and hence do not have to be axiomatized in order to achieve Henkin completeness.