Results 1  10
of
41
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 49 (12 self)
 Add to MetaCart
In this article we describe the data model of the MBase system, a webbased,
System Description: MathWeb, an AgentBased Communication Layer for Distributed Automated Theorem Proving
, 1999
"... Realworld applications of theorem proving require open and modern software environments that enable modularization,... ..."
Abstract

Cited by 34 (14 self)
 Add to MetaCart
(Show Context)
Realworld applications of theorem proving require open and modern software environments that enable modularization,...
Comparing approaches to the exploration of the domain of residue classes
 ARTICLE SUBMITTED TO JOURNAL OF SYMBOLIC COMPUTATION
, 2002
"... We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using different proof techniques, which are implemented as strategies in a multistrategy ..."
Abstract

Cited by 25 (13 self)
 Add to MetaCart
We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using different proof techniques, which are implemented as strategies in a multistrategy proof planner. The search space of the proof planner can be drastically reduced by employing computations of two computer algebra systems during the planning process. To test the eectiveness of our approach we carried out a large number of experiments and also compared it with some alternative approaches. In particular, we experimented with substituting computer algebra by model generation and by proving theorems with a first order equational theorem prover instead of a proof planner.
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 20 (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...
Exploring Properties of Residue Classes
, 2000
"... We report on an experiment in exploring properties of residue classes over the integers with the combined effort of a multistrategy proof planner and two computer algebra systems. An exploration module classifies a given set and a given operation in terms of the algebraic structure they form. It th ..."
Abstract

Cited by 19 (12 self)
 Add to MetaCart
(Show Context)
We report on an experiment in exploring properties of residue classes over the integers with the combined effort of a multistrategy proof planner and two computer algebra systems. An exploration module classifies a given set and a given operation in terms of the algebraic structure they form. It then calls the proof planner to prove or refute simple properties of the operation. Moreover, we use different proof planning strategies to implement various proving techniques: from naive testing of all possible cases to elaborate techniques of equational reasoning and reduction to known cases.
Combined reasoning by automated cooperation
 JOURNAL OF APPLIED LOGIC
, 2008
"... Different reasoning systems have different strengths and weaknesses, and often it is useful to combine these systems to gain as much as possible from their strengths and retain as little as possible from their weaknesses. Of particular interest is the integration of firstorder and higherorder tech ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
Different reasoning systems have different strengths and weaknesses, and often it is useful to combine these systems to gain as much as possible from their strengths and retain as little as possible from their weaknesses. Of particular interest is the integration of firstorder and higherorder techniques. Firstorder reasoning systems, on the one hand, have reached considerable strength in
some niches, but in many areas of mathematics they still cannot reliably solve relatively simple problems, for example, when
reasoning about sets, relations, or functions. Higherorder reasoning systems, on the other hand, can solve problems of this kind
automatically. But the complexity inherent in their calculi prevents them from solving a whole range of problems. However, while
many problems cannot be solved by any one system alone, they can be solved by a combination of these systems.
We present a general agentbased methodology for integrating different reasoning systems. It provides a generic integration
framework which facilitates the cooperation between diverse reasoners, but can also be refined to enable more efficient, specialist
integrations. We empirically evaluate its usefulness, effectiveness and efficiency by case studies involving the integration of first
order and higherorder automated theorem provers, computer algebra systems, and model generators.
Certifying solutions to permutation group problems
 In F. Baader, ed, CADE19, LNAI 2741
, 2003
"... Abstract. We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our code provides both answers and a set of certificates enabling a user, or an intelligent software system, to pr ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our code provides both answers and a set of certificates enabling a user, or an intelligent software system, to provide a full proof of correctness of the answer. To guarantee correctness we use proof planning techniques, which construct proofs in a humanoriented reasoning style. This gives the human mathematician the necessary insight into the computed solution, as well as making it feasible to check the solution for relatively large groups. 1
A Proof Planning Framework for Isabelle
, 2005
"... Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to guide the proof process. The idea is to capture common patterns of reasoning which can be used to derive abstract descriptions of proofs known as proof plans. These can then be executed to provide fully ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to guide the proof process. The idea is to capture common patterns of reasoning which can be used to derive abstract descriptions of proofs known as proof plans. These can then be executed to provide fully formal proofs. This thesis concerns the development and analysis of a novel approach to proof planning that focuses on an explicit representation of choices during search. We embody our approach as a proof planner for the generic proof assistant Isabelle and use the Isar language, which is humanreadable and machinecheckable, to represent proof plans. Within this framework we develop an inductive theorem prover as a case study of our approach to proof planning. Our prover uses the difference reduction heuristic known as rippling to automate the step cases of the inductive proofs. The development of a flexible approach to rippling that supports its various modifications and extensions is the second major focus of this thesis. Here, our inductive theorem prover provides a context in which to evaluate rippling experimentally. This work results in an efficient and powerful inductive theorem prover for Isabelle as well as proposals for further improving the efficiency of rippling. We also draw observations in order
An Overview of A Formal Framework For Managing Mathematics
 Annals of Mathematics and Artificial Intelligence
, 2003
"... Mathematics is a process of creating, exploring, and connecting mathematical models. This paper presents an overview of a formal framework for managing the mathematics process as well as the mathematical knowledge produced by the process. The central idea of the framework is the notion of a biform t ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
(Show Context)
Mathematics is a process of creating, exploring, and connecting mathematical models. This paper presents an overview of a formal framework for managing the mathematics process as well as the mathematical knowledge produced by the process. The central idea of the framework is the notion of a biform theory which is simultaneously an axiomatic theory and an algorithmic theory. Representing a collection of mathematical models, a biform theory provides a formal context for both deduction and computation. The framework includes facilities for deriving theorems via a mixture of deduction and computation, constructing sound deduction and computation rules, and developing networks of biform theories linked by interpretations. The framework is not tied to a specific underlying logic; indeed, it is intended to be used with several background logics simultaneously. Many of the ideas and mechanisms used in the framework are inspired by the imps Interactive Mathematical Proof System and the Axiom computer algebra system.
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 12 (1 self)
 Add to MetaCart
(Show Context)
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