Strong and weak points of the MUSCADET theorem prover - examples from CASC-JC

Authors:
Dominique Pastre
Affiliations:
Crip5, Université René Descartes - Paris 5, 45 rue des Saints Pères, F-75270 Paris Cedex, France E-mail: pastre@math-info.univ-paris5.fr
Venue:
AI Communications - CASC
Year:
2002

Citing 6
Cited 1

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
MUSCADET: an automatic theorem proving system using knowledge and metaknowledge in mathematics

Artificial Intelligence
Metalogical frameworks

Papers presented at the second annual Workshop on Logical environments
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The TPTP Problem Library

Journal of Automated Reasoning
The Markgraf Karl Refutation Procedure (MKRP)

Proceedings of the 8th International Conference on Automated Deduction

The 3rd IJCAR Automated Theorem Proving Competition

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001).