非表示:
キーワード:
-
要旨:
There are several different methods which try to decide unsatisfiability of a
set of clauses by generating an unsatisfiable set of instances of the input
clauses. We consider the \emph{Disconnection Tableau Calculus}, \emph{Primal
Partial Instantiation} and \emph{Resolution-Based Instance-Generation}, all of
which can be seen as refinements of the clause linking approach. We present
these three methods accurately and in a consistent manner. Similarities and
equivalences of the methods will be pointed out and we will show if proofs of
one calculus can be simulated by a different method, generating only instances
from the given proof.
