Results 1  10
of
13
OMDoc: Towards an Internet Standard for the Administration, Distribution and Teaching of mathematical Knowledge
 IN PROCEEDINGS AISC'2000
, 2000
"... In this paper we present an extension OMDoc to the OpenMath standard that allows to represent the semantics and structure of various kinds of mathematical documents, including articles, textbooks, interactive books, courses. It can serve as the content language for agent communication of mathematic ..."
Abstract

Cited by 42 (5 self)
 Add to MetaCart
In this paper we present an extension OMDoc to the OpenMath standard that allows to represent the semantics and structure of various kinds of mathematical documents, including articles, textbooks, interactive books, courses. It can serve as the content language for agent communication of mathematical services on a mathematical software bus.
MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems
, 2000
"... In this article we describe the data model of the MBase system, a webbased, ..."
Abstract

Cited by 41 (11 self)
 Add to MetaCart
In this article we describe the data model of the MBase system, a webbased,
Modular Data Structure Verification
 EECS DEPARTMENT, MASSACHUSETTS INSTITUTE OF TECHNOLOGY
, 2007
"... This dissertation describes an approach for automatically verifying data structures, focusing on techniques for automatically proving formulas that arise in such verification. I have implemented this approach with my colleagues in a verification system called Jahob. Jahob verifies properties of Java ..."
Abstract

Cited by 36 (21 self)
 Add to MetaCart
This dissertation describes an approach for automatically verifying data structures, focusing on techniques for automatically proving formulas that arise in such verification. I have implemented this approach with my colleagues in a verification system called Jahob. Jahob verifies properties of Java programs with dynamically allocated data structures. Developers write Jahob specifications in classical higherorder logic (HOL); Jahob reduces the verification problem to deciding the validity of HOL formulas. I present a new method for proving HOL formulas by combining automated reasoning techniques. My method consists of 1) splitting formulas into individual HOL conjuncts, 2) soundly approximating each HOL conjunct with a formula in a more tractable fragment and 3) proving the resulting approximation using a decision procedure or a theorem prover. I present three concrete logics; for each logic I show how to use it to approximate HOL formulas, and how to decide the validity of formulas in this logic. First, I present an approximation of HOL based on a translation to firstorder logic, which enables the use of existing resolutionbased theorem provers. Second, I present an approximation of HOL based on field constraint analysis, a new technique that enables
Towards interoperable mechanized reasoning systems: the logic broker architecture
 AI*IATABOO Workshop `From Objects to Agents: Evolutionary Trends of Software Systems
, 2000
"... There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. Stateoftheart reasoning systems are the result of many manyears of careful development and engineering, and usually they provide a high ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. Stateoftheart reasoning systems are the result of many manyears of careful development and engineering, and usually they provide a high degree of sophistication in their respective domain. Yet they often perform poorly when applied outside the domain they have been designed for. The problem of integrating mechanized reasoning systems is therefore being perceived as an important issue in automated reasoning. In this paper we present the Logic Broker Architecture, a framework which provides the needed infrastructure for making mechanized reasoning systems interoperate. The architecture provides location transparency, a way to forward requests for logical services to appropriate reasoning systems via a simple registration/subscription mechanism, and a translation mechanism which ensures the transparent and provably sound exchange of logical services. 1
OMDoc: An infrastructure for openmath content dictionary information
 BULLETIN OF THE ACM SPECIAL INTEREST GROUP ON SYMBOLIC AND AUTOMATED MATHEMATICS (SIGSAM
, 2000
"... The OpenMath framework for transmitting mathematical objects over the Internet relies on the concept of Content Dictionaries (CDs) to define the semantics of mathematical objects. This is an essential measure for establishing a meaningful communication amongst mathematical software systems (and huma ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
The OpenMath framework for transmitting mathematical objects over the Internet relies on the concept of Content Dictionaries (CDs) to define the semantics of mathematical objects. This is an essential measure for establishing a meaningful communication amongst mathematical software systems (and humans). Currently, the infrastructure for conceiving, administering, viewing CDs is limited to a filebased almost flat repository. In this paper, we propose to use the OMDoc extension of the OpenMath Xml encoding as an infrastructure to express and manipulate content dictionary information. OMDoc extends OpenMath by adding support for document markup (making the CDs more readable to the human user) and structured specification (making them more explicit, formal, and allow the user to reuse, and inherit CD information in a flexible, but welldefined way).
A program certification assistant based on fully automated theorem provers
 In Proc. Intl. Workshop on User Interfaces for Theorem Provers, Electronic Notes in Theoretical Computer Science
, 2005
"... We describe a certification assistant to support formal safety proofs for programs. It is based on a graphical user interface that hides the lowlevel details of firstorder automated theorem provers while supporting limited interactivity: it allows users to customize and control the proof process o ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We describe a certification assistant to support formal safety proofs for programs. It is based on a graphical user interface that hides the lowlevel details of firstorder automated theorem provers while supporting limited interactivity: it allows users to customize and control the proof process on a high level, manages the auxiliary artifacts produced during this process, and provides traceability between the proof obligations and the relevant parts of the program. The certification assistant is part of a larger program synthesis system and is intended to support the deployment of automatically generated code in safetycritical applications. 1
Adaptive Course Generation and Presentation
, 2000
"... Today's interactive mathematics textbooks use a collection of predefined documents, typically organized as a network of HtML pages. This makes a reuse and a sound recombination of the encoded knowledge impossible and inhibits a radical adaption of course presentation and content to the user's needs ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Today's interactive mathematics textbooks use a collection of predefined documents, typically organized as a network of HtML pages. This makes a reuse and a sound recombination of the encoded knowledge impossible and inhibits a radical adaption of course presentation and content to the user's needs. In order to avoid these drawbacks we have designed a webbased framework for dynamically producing interactive documents for learning mathematics called ID. The system design relies on the separation of knowledge representation from system functionalities. Salient features of our system are the individual generation of interactive documents based on general domain knowledge, userspecific preferences and the user's knowledge as well as the integration of external problem solving systems. The paper describes the distributed webbased architecture of our system and the principles of its components.
A new framework for reasoning agents
 Proceedings of IJCAI03 Workshop on Agents and Automated Reasoning, pp.58–64
, 2003
"... Many case studies have shown that the combination of specialised reasoning systems can lead to synergetic effects and can widen the problem solving horizon of standalone reasoning systems. In the last few years we have further developed the MathWeb Software Bus (short MathWebSB) for the combinatio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Many case studies have shown that the combination of specialised reasoning systems can lead to synergetic effects and can widen the problem solving horizon of standalone reasoning systems. In the last few years we have further developed the MathWeb Software Bus (short MathWebSB) for the combination of reasoning systems on the system level. Despite the fact that the MathWebSB has been successfully used in many applications, we currently face some problems that are hard to solve without significant changes of the MathWebSB’s architecture. Building on many years of experience with with the integration of reasoning systems, we are currently developing a new framework for reasoning agents to solve these problems. In this paper, we present first ideas on how to realise our framework in the agent development environment JADE. 1
Agent based mathematical reasoning
 IN PROCEEDINGS OF THE CALCULEMUS WORKSHOP: SYSTEMS FOR INTEGRATED COMPUTATION AND DEDUCTION
, 1999
"... In this contribution we propose an agent architecture for theorem proving which we intend to investigate in depth in the future. The work reported in this paper is in an early state, and by no means finished. We present and discuss our proposal in order to get feedback from the Calculemus community. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this contribution we propose an agent architecture for theorem proving which we intend to investigate in depth in the future. The work reported in this paper is in an early state, and by no means finished. We present and discuss our proposal in order to get feedback from the Calculemus community.
Computational Discovery in Pure Mathematics
"... Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated theorem provers, programs designed to generate examples, mathematical databases, and theory formation programs on the body ..."
Abstract
 Add to MetaCart
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated theorem provers, programs designed to generate examples, mathematical databases, and theory formation programs on the body of knowledge in pure mathematics. We discuss to what extent the output from certain programs can be considered a discovery in pure mathematics. This enables us to assess the state of the art with respect to Newell and Simon’s prediction that a computer would discover and prove an important mathematical theorem. 1