Certifying solutions to permutation group problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2741, Issue , 2003, Pages 258-273

  Cohen, Arjeh ^a   Murray, Scott H ^a   Pollet, Martin ^b   Sorge, Volker ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b SAARLAND UNIVERSITY   (Germany)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; THEOREM PROVING; ALGORITHMS; COMPUTER SOFTWARE; INTEGRATION; PLANNING; PROBLEM SOLVING;

INTELLIGENT SOFTWARE SYSTEMS; LARGE GROUPS; PERMUTATION GROUP; PROOF OF CORRECTNESS; PROOF-PLANNING;

GROUP THEORY; COMPUTATIONAL METHODS;

COMPUTATIONAL PERMUTATION GROUP THEORY; GROUP ALGORITHMS; INTELLIGENT SOFTWARE SYSTEM; PROOF PLANNING;

EID: 7044232921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_20     Document Type: Conference Paper

References (13)

1. A. Bundy. The Use of Explicit Plans to Guide Inductive Proofs. In Proc. of CADE–9, LNCS 310, Springer, 1988
2. O. Caprotti and M. Oostdijk. Formal and efficient primality proofs by use of computer algebra oracles. J. of Symbolic Computation, 32(1/2), 2001
3. A. Cohen and S. Murray. An automated proof theory approach to computation with permutation groups.Tech. report, Dept. of Mathematics, TUEindhoven, 2002
4. J. Siekmann et al. Proof development with Omega. In Proc. of CADE–18, LNAI 2392. Springer, 2002
5. A. Fiedler. P.rex: An interactive proof explainer. In Proc. of IJCAR-2001, LNAI 2083. Springer, 2001
6. The GAP Group, Aachen, St Andrews. GAP–Groups, Algorithms, and Programming, Version 4, 1998. http://www-gap.dcs.st-and.ac.uk/˜gap
7. J. Harrison and L. Théry. A Skeptic’s Approach to Combining HOL and Maple. J. of Automated Reasoning, 21(3), 1998
8. D. Kapur and D. Wang, editors. J. of Automated Reasoning— Special Issue on the Integration of Deduction and Symbolic Computation Systems, volume 21(3). 1998
9. M. Kerber, M. Kohlhase, and V. Sorge. Integrating Computer Algebra Into Proof Planning. J. of Automated Reasoning, 21(3), 1998
10. I. Kraan, D. Basin, and A. Bundy. Middle-Out Reasoning for Logic Program Synthesis. Technical Report MPI-I-93-214, Max-Planck-Institut, Germany, 1993
11. A. Meier, M. Pollet, and V. Sorge. Comparing Approaches to the Exploration of the Domain of Residue Classes. J. of Symbolic Computation, 34(4), 2002
12. E. Melis and J. Siekmann. Knowledge-Based Proof Planning. Artificial Intelligence, 115(1), 1999
13. V. Sorge. Non-Trivial Symbolic Computations in Proof Planning. In Proc. of FROCOS 2000, LNCS 1794. Springer, 2000