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.
CITATION STYLE
Cohen, A., Murray, S. H., Pollet, M., & Sorge, V. (2003). Certifying solutions to permutation group problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 258–273). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_20
Mendeley helps you to discover research relevant for your work.