Results 1  10
of
25
OMDoc an open markup format for mathematical documents (version 1.2
 Number 4180 in LNAI
, 2006
"... This Document is an online version of the OMDoc 1.2 Specification published by ..."
Abstract

Cited by 150 (34 self)
 Add to MetaCart
This Document is an online version of the OMDoc 1.2 Specification published by
The Heterogeneous Tool Set
 of Lecture Notes in Computer Science
, 2007
"... Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover, a formal software development process may lead to a change of formalism during the development. However, current resea ..."
Abstract

Cited by 36 (21 self)
 Add to MetaCart
(Show Context)
Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover, a formal software development process may lead to a change of formalism during the development. However, current research in integrated formal methods only deals with adhoc integrations of different formalisms. The heterogeneous tool set (Hets) is a parsing, static analysis and proof management tool combining various such tools for individual specification languages, thus providing a tool for heterogeneous multilogic specification. Hets is based on a graph of logics and languages (formalized as socalled institutions), their tools, and their translations. This provides a clean semantics of heterogeneous specification, as well as a corresponding proof calculus. For proof management, the calculus of development graphs (known from other largescale proof management systems) has been adapted to heterogeneous specification. Development graphs provide an overview of the (heterogeneous) specification module hierarchy and the current proof state, and thus may be used for monitoring the overall correctness of a heterogeneous development. 1
Proof Development with ΩMEGA
 PROCEEDINGS OF THE 18TH CONFERENCE ON AUTOMATED DEDUCTION (CADE–18), VOLUME 2392 OF LNAI
, 2002
"... ..."
Qualitative constraint calculi: Heterogeneous verification of composition tables
 In 20th International FLAIRS Conference
, 2007
"... In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the past 25 years, a large number of calculi for efficient reasoning about spatial and temporal entities has been developed. Reasoning techniques developed for these constraint calculi typically rely on socalle ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the past 25 years, a large number of calculi for efficient reasoning about spatial and temporal entities has been developed. Reasoning techniques developed for these constraint calculi typically rely on socalled composition tables of the calculus at hand, which allow for replacing semantic reasoning by symbolic operations. Often these composition tables are developed in a quite informal, pictorial manner and hence composition tables are prone to errors. In view of possible safety critical applications of qualitative calculi, however, it is desirable to formally verify these composition tables. In general, the verification of composition tables is a tedious task, in particular in cases where the semantics of the calculus depends on higherorder constructs such as sets. In this paper we address this problem by presenting a heterogeneous proof method that allows for combining a higherorder proof assistance system (such as Isabelle) with an automatic (first order) reasoner (such as SPASS or VAMPIRE). The benefit of this method is that the number of proof obligations that is to be proven interactively with a semiautomatic reasoner can be minimized to an acceptable level.
Parsing, editing, proving: The PGIP display protocol
 In User Interfaces for Theorem Provers UITP’05
, 2005
"... This paper describes how proof texts are constructed and edited in the Proof General Kit framework. Proof texts are the central object of development within our framework and we want to allow flexible ways to construct them, both explicitly via text editing and implicitly by graphical manipulation ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
This paper describes how proof texts are constructed and edited in the Proof General Kit framework. Proof texts are the central object of development within our framework and we want to allow flexible ways to construct them, both explicitly via text editing and implicitly by graphical manipulation or metamanipulation. To this end, the framework allows for useroriented display components, connected to provers via a central broker component. The display components and the broker exchange messages in a format specified by the PGIP display protocol, which facilitates parsing, editing and proving of proof texts. The design of this part of the framework is new; the remainder of the framework, which connects the prover components to the broker, is based more closely on refining work of the previous Proof General project, and was described in [4]. 1
The Service Architecture in the ACTIVEMATH Learning Environment
 First International Kaleidoscope Learning Grid SIG Workshop on Distributed eLearning Environ ments. British Computer Society
, 2005
"... We discuss the usage of webservices in the ACTIVEMATH learning environment, describe the prototypes implemented and the experience gained. Requirements for an ideal webservice technology are described. They include the notion of event propagation as well as the consideration for stateful webservi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We discuss the usage of webservices in the ACTIVEMATH learning environment, describe the prototypes implemented and the experience gained. Requirements for an ideal webservice technology are described. They include the notion of event propagation as well as the consideration for stateful webservices. Finally we propose models to make the webservices of ACTIVEMATH available to client components without affecting privacy or security. Further work, within the LE ACTIVEMATH EU project is described.
ΩMEGA: Computer supported mathematics
 IN: PROCEEDINGS OF THE 27TH GERMAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (KI 2004)
, 2004
"... The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated dedu ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proofchecked by a computer. Classical theorem proving procedures of today are 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
Brokers and Webservices for automatic deduction: a case study
 In Therese Hardin and Renaud Rioboo, editors, Calculemus 2003
"... Abstract. We present a planning broker and several WebServices for automatic deduction. Each WebService implements one of the tactics usually available in interactive proofassistants. When the broker is submitted a \proof status " (an incomplete proof tree and a focus on an open goal) it di ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present a planning broker and several WebServices for automatic deduction. Each WebService implements one of the tactics usually available in interactive proofassistants. When the broker is submitted a \proof status " (an incomplete proof tree and a focus on an open goal) it dispatches the proof to the WebServices, collects the successful results, and send them back to the client as \hints " as soon as they are available. In our experience this architecture turns out to be helpful both for experienced users (who can take benet of distributing heavy computations) and beginners (who can learn from it). 1
A graphbased approach towards discerning inherent structures in a digital library of formal mathematics
 In Lecture Notes in Computer Science
, 2004
"... Abstract. As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, it becomes increasingly valuable to find automated means to manage this data and capture semantics such as rel ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, it becomes increasingly valuable to find automated means to manage this data and capture semantics such as relatedness and significance. We apply graphbased approaches, such as HITS, or HyperlinkInduced Topic Search, [11] used for World Wide Web document search and analysis, to formal mathematical data collections. The nodes of the graphs we analyze are theorems and definitions, and the links are logical dependencies. By exploiting this link structure, we show how one may extract organizational and relatedness information from a collection of digital formal math. We discuss the value of the information we can extract, yielding potential applications in math search tools, theorem proving, and education.