Classifying Isomorphic Residue Classes

Authors:
Andreas Meier;Martin Pollet;Volker Sorge
Affiliations:
-;-;-
Venue:
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Year:
2001

Citing 13
Cited 1

Interpolating polynomials from their values

Journal of Symbolic Computation - Special issue on computational algebraic complexity
The Maple handbook: Maple V Release 4

The Maple handbook: Maple V Release 4
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On feasible multivariate polynomial interpolations over arbitrary fields

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Knowledge-based proof planning

Artificial Intelligence
Exploring properties of residue classes

Symbolic computation and automated reasoning
Integrating Computer Algebra into Proof Planning

Journal of Automated Reasoning
Preface

Journal of Automated Reasoning
The Use of Explicit Plans to Guide Inductive Proofs

Proceedings of the 9th International Conference on Automated Deduction
Exploring Abstract Algebra in Constructive Type Theory

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Non-Trivial Symbolic Computations in Proof Planning

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Omega: Towards a Mathematical Assistant

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Automatic generation of some results in finite algebra

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1

Employing Theory Formation to Guide Proof Planning

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 proving techniques, which are implemented as strategies in a multi-strategy proof planner. We show how these techniques help to successfully derive proofs in our domain and explain how the search space of the proof planner can be drastically reduced by employing computations of two computer algebra systems during the planning process. Moreover, we discuss the results of experiments we conducted which give evidence that with the help of the computer algebra systems the planner is able to solve problems for which it would fail to create a proof otherwise.