Results 1  10
of
14
Extending the HOL theorem prover with a Computer Algebra System to Reason about the Reals
 Higher Order Logic Theorem Proving and its Applications (HUG `93
, 1993
"... In this paper we describe an environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system. 1 Introduction Computer theorem provers are a topic of research interest in their own right. However much of their popularity stems from ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
In this paper we describe an environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system. 1 Introduction Computer theorem provers are a topic of research interest in their own right. However much of their popularity stems from their application in computeraided verification, i.e. proving that designs of electronic or computer systems, programs, protocols and cryptosystems satisfy certain properties. Such proofs, as compared with the proofs one finds in mathematics books, usually involve less sophisticated central ideas, but contain far more technical Supported by the Science and Engineering Research Council, UK. y Supported by SERC grant GR/G 33837 and a grant from DSTO Australia. details and therefore tend to be much more difficult for humans to write or check without making mistakes. Hence it is appealing to let computers help. Some fundamental mathematical theories, such as arithmetic, are usually requi...
Rational handling of multiple goals for mobile robots
 Artificial Intelligence Planning 'ystems: Proceedings of the First International Conference (AIP' 92
, 1992
"... The mobile robot planning domain is dynamic, with goals becoming active asynchronously. In order to successfully operate in this environment, a robot must be able to interrupt and reformulate its plans of action onthefly. This paper investigates a method for incorporating the accomplishment of a n ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
The mobile robot planning domain is dynamic, with goals becoming active asynchronously. In order to successfully operate in this environment, a robot must be able to interrupt and reformulate its plans of action onthefly. This paper investigates a method for incorporating the accomplishment of a new goal into a partially executed plan. A decision theoretic approach using net present value as the decision criterion serves as the basis for doing dynamic goal ordering. The appropriateness of net present value over benefitcost ratio is argued. The approach has been implemented on a robot operating in an office setting. Examples from this domain are used to show the advantages of the approach with respect to fixed priority and heuristic based approaches. 1
1987]. \Analytic Variations on the Common Subexpression Problem
 Proceedings of the 17th Annual International Colloquium on Automata, Languages, and Programming (ICALP
, 1990
"... Abstract. Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction can be effected in linear time. It is used to save storage in implementations of functional programming language ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract. Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction can be effected in linear time. It is used to save storage in implementations of functional programming languages, as well as in symbolic manipulation and computer a/gebra systems. In compiling, the compaction problem is known as the "common subexpression problem " and it plays a central r61e in register allocation, code generation and optimisation. We establish here that, under a variety of probabilistic models, a tree of size n has a compacted form of expected size asymptotically n C.ogWi ' where the constant C is explicitly related to the type of trees to be compacted and to the statistical model reflecting tree usage. In particular the savings in storage approach 100 % on average for large structures, which overperforms the commonly used form of sharing that is restmcted to leaves (atoms). Introduction. A tree can be compacted by representing occurrences of repeated subtrees only once. In that case, several pointers will point to the representation of any common subtree,
Reasoning About the Reals: the marriage of HOL and Maple
, 1993
"... . Computer algebra systems are extremely powerful and flexible, but often give results which require careful interpretation or are downright incorrect. By contrast, theorem provers are very reliable but lack the powerful specialized decision procedures and heuristics of computer algebra systems. In ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. Computer algebra systems are extremely powerful and flexible, but often give results which require careful interpretation or are downright incorrect. By contrast, theorem provers are very reliable but lack the powerful specialized decision procedures and heuristics of computer algebra systems. In this paper we try to get the best of both worlds by careful exploitation of a link between a theorem prover and a computer algebra system. 1 Motivation In the HOL theorem prover[5], a theory of real numbers has been developed, using a rigorous definition in terms of Dedekind cuts [8]. It is therefore possible to apply HOL to areas traditionally within the purview of Computer Algebra Systems (CASs). This offers two main benefits. Firstly, theorem provers are designed to manipulate proofs and theorems in a coherent and structured way, with all concepts clearly defined. By contrast, most CASs have no concept of `logic' as such  they usually take an algebraic expression and return another pur...
ActiveMath: System Description
, 2001
"... , the knowledge base MBase [3], a presentation planner (see x2), a user model, a pedagogical module, and deduction and The project which led to the results presented in this paper was funded by the German Bundesministerium fur Bildung und Forschung, contract 01AK008/2. The authors are responsible fo ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
, the knowledge base MBase [3], a presentation planner (see x2), a user model, a pedagogical module, and deduction and The project which led to the results presented in this paper was funded by the German Bundesministerium fur Bildung und Forschung, contract 01AK008/2. The authors are responsible for the content of this publication. 2 computation service systems such as the proof planner of\Omega mega [6] and the Computer Algebra System (CAS) Maple [2]. The components can communicate over the Internet by a standardized xmlrpc protocol[7]. In Figure 1, the arrows represent the data flow between the components. For instance, requests of the user and (in the other direction) htmlpages are communicated via a webserver. The presentation planner requests and processes information from MBase, from the user model, and from the pedagogical module in order to gen
Efficient Solution Of Large Sparse Eigenvalue Problems In Microelectronic Simulation
 Prvc. of the Cornelius Lanczos Int. Centenary
, 1993
"... CONTENTS CHAPTER PAGE 1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2 EFFICIENT NUMERICAL SIMULATION OF ELECTRON STATES IN QUANTUM WIRES : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
CONTENTS CHAPTER PAGE 1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2 EFFICIENT NUMERICAL SIMULATION OF ELECTRON STATES IN QUANTUM WIRES : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.2 The equations : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 2.3 Reformulation as a fixed point problem : : : : : : : : : : : : : : : : : : : 13 2.4 The Eigenvalue Problem for Schrodinger's Equation : : : : : : : : : : : : 16 2.5 The Solution of the Nonlinear Poisson Equation : : : : : : : : : : : : : : 18 2.6 Stabilization and Acceleration : : : : : : : : : : : : : : : : : : : : : : : : 21 2.6.1 Stabilization by Adaptive Underrelaxation : : : : : : : : : : : : : 22 2.6.2 Acceleration by New
Iterative Solution of the Eigenvalue Problem for a Dielectric Waveguide
 IEEE Trans. MTT
, 1991
"... We present a numerical approach to the simulation of dielectric waveguides that is free of spurious modes and is based on the solution of an eigenvalue problem for the two transverse components of the magnetic field. We introduce a new discretization which has several computational advantages. In pa ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a numerical approach to the simulation of dielectric waveguides that is free of spurious modes and is based on the solution of an eigenvalue problem for the two transverse components of the magnetic field. We introduce a new discretization which has several computational advantages. In particular, by careful design of the discretization procedure we obtain systems of equations for the two components which are equivalent in the sense that a rotation over 90 ffi corresponds to a suitable permutation of indices. The eigenvalue problem is solved iteratively by using an adapted version of the Chebyshev Arnoldi algorithm. This approach takes full advantage of the sparsity of the matrix and circumvents the large memory requirements and the large computational complexity associated with dense methods. This allows us to employ meshes that are sufficiently fine to resolve higher modes without large discretization errors. 1 Introduction Dielectric channel waveguides are widely u...
The `Interactive Textbook' Project
"... . The `Interactive Textbook' project provides an architecture, basic knowledge representations, and techniques for secondgeneration interactive mathematics documents (textbooks, courses, tutorials) exhibiting, among others, the following features: separation of knowledge representation and func ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. The `Interactive Textbook' project provides an architecture, basic knowledge representations, and techniques for secondgeneration interactive mathematics documents (textbooks, courses, tutorials) exhibiting, among others, the following features: separation of knowledge representation and functionalities, knowledge representation in an XML format that extends OpenMath, and adaptivity. The `Interactive Textbook ' includes an interactive proof planning system and computer algebra systems for exploratory learning purposes and uses knowledge acquired for automated proof planning to support active learning of mathematics. A prototypical interactive textbook is being implemented that will realize the dierent features explained and motivated in this paper. 1 Introduction Our previous work resulted in systems such as MathWeb [9] and the prototypical proof assistant system mega [1] including knowledgebased proof planning [12] and in ideas for a mathematical knowledge base [8]. ...
Sparse Polynomial Multiplication and Division in Maple 14
, 2009
"... We report on new codes for sparse multivariate polynomial multiplication and division over the integers that we have integrated into Maple 14’s expand and divide commands. We describe our polynomial data structure and compare it with the one used by Maple. We then present some benchmarks comparing o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We report on new codes for sparse multivariate polynomial multiplication and division over the integers that we have integrated into Maple 14’s expand and divide commands. We describe our polynomial data structure and compare it with the one used by Maple. We then present some benchmarks comparing our software with the Magma, Maple, Singular, Trip and Pari computer algebra systems and also illustrating how multivariate polynomial factorization benefits from our improvements to polynomial multiplication and division. This work was supported by the MITACS NCE of Canada and Maplesoft. 1
Exact Solution of Linear Equation Systems over Rational Numbers by Parallel pAdic Arithmetic
 PARALLEL PROCESSING: CONPAR 94 VAPP VI, LNCS
, 1994
"... We describe a parallel implementation of an algorithm for solving systems of linear equations over the field of rational numbers based on Gaussian elimination. The rationals are represented by truncated padic expansion. This approach permits us to do error free computations directly over the ratio ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe a parallel implementation of an algorithm for solving systems of linear equations over the field of rational numbers based on Gaussian elimination. The rationals are represented by truncated padic expansion. This approach permits us to do error free computations directly over the rationals without converting the system to an equivalent one over the integers. The parallelization is based on a multiple homomorphic image technique and the result is recovered by a parallel version of the Chinese remainder algorithm. Using a MIMD machine, we compare the proposed implementation with the classical modular arithmetic, showing that truncated padic arithmetic is a feasible tool for solving systems of linear equations. The proposed implementation leads to a speedup up to seven by ten processors with respect to the sequential implementation.