HyperS tableaux -- heuristic hyper tableaux. Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux. In this paper we propose a new calculus, called hyperS tableaux, which overcomes substantial drawbacks of hyper tableaux. In contrast to hyper tableaux, hyperS tableaux are entirely automated and heuristic. We prove the soundness and the completeness of hyperS tableaux. HyperS tableaux are applied in the theorem prover Sofia, which additionally provides useful tools for clause set generation (based on justificational tableaux) and for tableau simplification (based on redundancy), and advantageous heuristics as well. An additional feature is the support of the so-called parametrized theorems, which makes the prover able to give compound answers.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.