theorem prover造句怎么写

This is an automated theorem prover for first-order and equational logic, used to support inference in language processing.

Although less automatic, efficient usage of a theorem prover can handle much larger designs than model checkers and requires less memory.

Or else, the abstraction may throw away so much information that the theorem prover may yield results that are correct for the abstraction, but incorrect for the program being analysed.

Completely automated theorem provers, such as model checkers, operate on an abstraction of the problem.

Effective use of a theorem prover requires a solid understanding of the internal operations of the tool and a familiarity with the mathematical proof process.

Without automated theorem prover, programmers have to generate all proofs by hand, which is a huge workload.

With the aid of the research fruits from the automated geometry theoremproving, this paper can implement the software with intelligence mentioned aboveby embedding the geometry theorem prover (GTP) in the DGS.