System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning

Zimmer, Jürgen; Kohlhase, Michael

doi:10.1007/3-540-45620-1_11

Cited by 12 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The previously monolithic system has been split up and separated into several independent modules (see Fig. 2), which are connected via the mathematical software bus MATHWEB-SB [99]. An important benefit is that MATHWEB-SB modules can be distributed over the Internet and are then remotely accessible by other research groups as well.…”

Section: System Overviewmentioning

confidence: 99%

Computer supported mathematics with Ωmega

Siekmann

Benzmüller

Autexier

2006

Journal of Applied Logic

View full text Add to dashboard Cite

Classical automated theorem proving of today is based on ingenious search techniques to find a proof for a given theorem in very large search spaces-often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited.The shift from search based methods to more abstract planning techniques however opened up a paradigm for mathematical reasoning on a computer and several systems of that kind now employ a mix of interactive, search based as well as proof planning techniques.The MEGA system is at the core of several related and well-integrated research projects of the MEGA research group, whose aim is to develop system support for a working mathematician as well as a software engineer when employing formal methods for quality assurance. In particular, MEGA supports proof development at a human-oriented abstract level of proof granularity. It is a modular system with a central proof data structure and several supplementary subsystems including automated deduction and computer algebra systems. MEGA has many characteristics in common with systems like NUPRL, COQ, HOL, PVS, and ISABELLE. However, it differs from these systems with respect to its focus on proof planning and in that respect it is more similar to the proof planning systems CLAM and λCLAM at Edinburgh.

show abstract

Section: System Overviewmentioning

confidence: 99%

Computer supported mathematics with Ωmega

Siekmann

Benzmüller

Autexier

2006

Journal of Applied Logic

View full text Add to dashboard Cite

show abstract

“…A system specialized in automated reasoning is MathWeb-SB (formerly Math-Web) [43][44][45]. It has been developed at the Universität des Saarlandes as a service infrastructure offering a uniform interface that can access different CAS (Maple TM , Magma, GAP and μCAS) and automated theorem provers (EQP, Otter, ProTein, Spass, WaldMeister, TPS and LEO).…”

Section: Related Workmentioning

confidence: 99%

Artificial Intelligence and Symbolic Computation

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…Research in mathematics, logic, and computer science has led to computer algebra systems (CAS's) and theorem provers (TPs). Languages like OMDoc [14] show good promise of having a universal way to share CAS and TP data in a mathematical software network [22].…”

Section: On the Way To A Mathematical Vernacular For Computersmentioning

confidence: 99%

Flexible Encoding of Mathematics on the Computer

Kamareddine¹,

Maarek²,

Wells³

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports multiple views of mathematical texts, including natural language views using the exact text that the mathematician wants to use. Thus, MathLang now supports the ability to capture the essential mathematical structure of mathematics written using natural language text. We show examples of how arbitrary mathematical text can be encoded in MathLang without needing to change any of the words or symbols of the texts or their order. In particular, we show the encoding of a theorem and its proof that has been used by Wiedijk for comparing many theorem prover representations of mathematics, namely the irrationality of √ 2 (originally due to Pythagoras). We encode a 1960 version by Hardy and Wright, and a more recent version by Barendregt.

show abstract

System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning

Cited by 12 publications

References 5 publications

Computer supported mathematics with Ωmega

Computer supported mathematics with Ωmega

Artificial Intelligence and Symbolic Computation

Flexible Encoding of Mathematics on the Computer

Contact Info

Product

Resources

About