Certifying solutions to permutation group problems

A.M. Cohen, S.H. Murray, M. Pollet, V. Sorge

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
1 Downloads (Pure)


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 human-oriented 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.
Original languageEnglish
Title of host publicationAutomated Deduction (Proceedings CADE-19, Miami Beach FL, USA, July 28-August 2, 2003)
EditorsF. Baader
Place of PublicationBerlin
ISBN (Print)3-540-40559-3
Publication statusPublished - 2003
Eventconference; 19th International Conference on Automated Deduction; 2003-07-28; 2003-08-02 -
Duration: 28 Jul 20032 Aug 2003

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conferenceconference; 19th International Conference on Automated Deduction; 2003-07-28; 2003-08-02
Other19th International Conference on Automated Deduction


Dive into the research topics of 'Certifying solutions to permutation group problems'. Together they form a unique fingerprint.

Cite this