Use of unit clauses and clause splitting in automatic deduction
Shie-Jue Lee, David A. Plaisted
Abstract
Shie-Jue Lee, David A. Plaisted
Abstract
A mechanical theorem prover usually has to perform unification which is a very time-consuming operation. Therefore, it is necessary to reduce the number of unification operations to obtain speedups. There are two ways to do this. One is to restrict the literals to be unified with the underlying literal, and the other is to make clauses small. Four techniques: unit simplification, ground unit clause generation, UR simulation, and small proof checking, can restrict the literals to be unified with. All these techniques take advantage of unit clauses. The clause splitting technique is able to reduce the length of a clause by splitting the clause into shorter clauses. These techniques improve dramatically the efficiency of a theorem prover, using the hyper-linking method, in many cases.>
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A mechanical theorem prover usually has to perform unification which is a very time-consuming operation. Therefore, it is necessary to reduce the number of unification operations to obtain speedups. There are two ways to do this. One is to restrict the literals to be unified with the underlying literal, and the other is to make clauses small. Four techniques: unit simplification, ground unit clause generation, UR simulation, and small proof checking, can restrict the literals to be unified with. All these techniques take advantage of unit clauses. The clause splitting technique is able to reduce the length of a clause by splitting the clause into shorter clauses. These techniques improve dramatically the efficiency of a theorem prover, using the hyper-linking method, in many cases.>
Key concepts: Unification, Literal (mathematical logic), Automated theorem proving, Gas meter prover, Computer science, Unit (ring theory), Programming language, Algorithm