Boyer–Moore theorem prover
E347187
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
All labels observed (4)
| Label | Occurrences |
|---|---|
| Boyer–Moore theorem prover canonical | 4 |
| Nqthm theorem prover | 3 |
| Boyer–Moore theorem prover (Nqthm) | 1 |
| Nqthm (Boyer–Moore theorem prover) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T3305991 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Boyer–Moore theorem prover Context triple: [J Strother Moore, knownFor, Boyer–Moore theorem prover]
-
A.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
B.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
C.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Boyer–Moore theorem prover Target entity description: The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
A.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
B.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
C.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
D.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
E.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
automated reasoning system
ⓘ
automated theorem prover ⓘ software system ⓘ |
| application |
verification of hardware designs
ⓘ
verification of recursive programs ⓘ verification of software correctness proofs ⓘ |
| approach |
automation of equational reasoning with heuristics
ⓘ
goal-directed rewriting ⓘ induction over recursively defined data structures ⓘ |
| basedOn |
equational logic
ⓘ
term rewriting ⓘ |
| countryOfOrigin |
United States of America
ⓘ
surface form:
United States
|
| developer |
J Strother Moore
ⓘ
Robert S. Boyer NERFINISHED ⓘ |
| field |
automated reasoning
ⓘ
first-order logic ⓘ formal methods ⓘ mathematical logic ⓘ program verification ⓘ recursive function theory ⓘ |
| hasPart |
induction heuristic
ⓘ
rewriting engine ⓘ simplifier ⓘ |
| historicalSignificance |
influential in the development of modern interactive theorem provers
ⓘ
one of the earliest successful automated theorem provers for program verification ⓘ |
| implementationLanguage |
Lisp programming language
ⓘ
surface form:
LISP
|
| influenced |
ACL2 theorem proving system
ⓘ
surface form:
ACL2
NQTHM ⓘ subsequent program verification systems ⓘ |
| logicType | first-order logic ⓘ |
| namedAfter |
J Strother Moore
ⓘ
Robert S. Boyer NERFINISHED ⓘ |
| notableFor |
inductive theorem proving
ⓘ
mechanical proof ⓘ program verification ⓘ rewriting-based reasoning ⓘ |
| pioneeringContribution |
automation of proofs about total recursive functions
ⓘ
integration of rewriting and induction in automated theorem proving ⓘ use of recursive function definitions as a basis for specification ⓘ |
| relatedTo |
Lisp programming language
ⓘ
surface form:
LISP
|
| supports |
equational reasoning
ⓘ
induction ⓘ recursive function definitions ⓘ |
| usedIn |
formalization of mathematics
ⓘ
research on mechanical proof ⓘ research on program verification ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Boyer–Moore theorem prover Description of subject: The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
Referenced by (9)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Nqthm (Boyer–Moore theorem prover)
this entity surface form:
Nqthm theorem prover
this entity surface form:
Nqthm theorem prover
this entity surface form:
Nqthm theorem prover
this entity surface form:
Boyer–Moore theorem prover (Nqthm)