ACL2 theorem proving system
E347188
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
All labels observed (10)
How this entity was disambiguated
This entity first appeared as the object of triple T3305992 — 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: ACL2 theorem proving system Context triple: [J Strother Moore, knownFor, ACL2 theorem proving system]
-
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.
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.
-
C.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
D.
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.
-
E.
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.
- 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: ACL2 theorem proving system Target entity description: The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
-
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.
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.
-
C.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
automated reasoning tool
ⓘ
programming language ⓘ theorem proving system ⓘ |
| appliedIn |
floating-point hardware verification
ⓘ
formalization of mathematics ⓘ microprocessor verification ⓘ software correctness proofs ⓘ |
| basedOn | Common Lisp ⓘ |
| designedFor | industrial-scale verification ⓘ |
| evaluationModel | applicative (functional) programming model ⓘ |
| hasComponent |
ACL2 logic
ⓘ
ACL2 theorem proving system self-linksurface differs ⓘ
surface form:
ACL2 programming environment
ACL2 theorem proving system self-linksurface differs ⓘ
surface form:
ACL2 prover
|
| hasDocumentation |
ACL2 theorem proving system
self-linksurface differs
ⓘ
surface form:
ACL2 User’s Manual
ACL2 books (library documentation) ⓘ |
| hasFeature |
certified books (libraries of theorems)
ⓘ
decision procedures for arithmetic ⓘ definitional principle for functions ⓘ executable specification language ⓘ guard mechanism for functions ⓘ inductive theorem proving ⓘ integration of programming and logic ⓘ interactive proof control ⓘ metafunctions and clause processors ⓘ proof automation ⓘ rewriting with conditional rewrite rules ⓘ total recursive functions ⓘ |
| hasProperty |
automation-oriented
ⓘ
executable specifications ⓘ sound (with respect to its logic) ⓘ supports large proof developments ⓘ |
| hasType | first-order logic theorem prover ⓘ |
| implements | subset of Common Lisp ⓘ |
| license | open source license ⓘ |
| logicStyle | quantifier-free first-order logic with induction ⓘ |
| paradigm | functional programming ⓘ |
| supports |
bit-level reasoning
ⓘ
integer arithmetic reasoning ⓘ mechanical verification ⓘ modeling of computer systems ⓘ reasoning about recursive data structures ⓘ symbolic simulation ⓘ |
| supportsPlatform |
Unix-like operating systems
ⓘ
Windows ⓘ
surface form:
Windows operating systems
macOS ⓘ |
| usedFor |
hardware verification
ⓘ
software verification ⓘ verification of mathematical theorems ⓘ |
| writtenIn | Common Lisp ⓘ |
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: ACL2 theorem proving system Description of subject: The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
Referenced by (15)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
ACL2
this entity surface form:
ACL2 (A Computational Logic for Applicative Common Lisp)
this entity surface form:
ACL2 theorem prover
this entity surface form:
ACL2 theorem prover
this entity surface form:
ACL2
subject surface form:
ACL2
this entity surface form:
ACL2 prover
subject surface form:
ACL2
this entity surface form:
ACL2 programming environment
ACL2 theorem proving system
→
hasDocumentation
→
ACL2 theorem proving system
self-linksurface differs
ⓘ
subject surface form:
ACL2
this entity surface form:
ACL2 User’s Manual
this entity surface form:
ACL2 theorem prover
this entity surface form:
ACL2
this entity surface form:
ACL2
this entity surface form:
ACL2 logic and theorem prover
this entity surface form:
"ACL2: An Industrial Strength Version of Nqthm"
this entity surface form:
ACL2 community