Proof planning is a technique for theorem proving which replaces the ultra-efficient but blind search of classical theorem proving systems by an informed knowledge-based planning process that employsâ€¦ (More)

Solving open quasigroup existence problems is a challenging problem to which SAT solvers have been applied successfully. However, the number of problems of this domain is relatively small and its useâ€¦ (More)

mega is a mixed-initiative system with the ultimate purpose of supporting theorem proving in mainstream mathematics and mathematics education. The current system consists of a proof planner and anâ€¦ (More)

The CASC competitions among automated theorem provers show that there is no single system that outperforms all other systems in all domains. One reaction to this observation is the combination ofâ€¦ (More)

Freek Wiedijk proposed the well-known theorem about the irrationality of âˆš 2 as a case study and used this theorem for a comparison of fifteen (interactive) theorem proving systems, which were askedâ€¦ (More)

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â€¦ (More)