1989
DOI: 10.1016/0004-3702(89)90035-0
|View full text |Cite
|
Sign up to set email alerts
|

MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1990
1990
2001
2001

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…And the proofs of theorems in resolution style are not readable, many people want to transform their proofs in other style into proofs in antural deduction style [2]. Recently many peolpe reseach non-resolution theorem proving [2,3,5,9,10], and specially natural deduction [5,9,10]. We have implemented an automatic natural deduction proving system {we call it ANDP system} by programming our unification algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…And the proofs of theorems in resolution style are not readable, many people want to transform their proofs in other style into proofs in antural deduction style [2]. Recently many peolpe reseach non-resolution theorem proving [2,3,5,9,10], and specially natural deduction [5,9,10]. We have implemented an automatic natural deduction proving system {we call it ANDP system} by programming our unification algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…The system is also able to work with second order statements. It may also receive knowledge and know-how for a specific domain from a human user; see [68] and [69]. These two possibilities are not used while working with the TPTP Library.…”
Section: Strategiesmentioning
confidence: 99%