The model building methods presented in this chapter are based on deductive saturation procedures. Instead of constructing refutation trees we consider resolution as an operator on sets of clauses. If a finite number of iterations of the operator leads to a fixed point set C then there are two possibilities: either C contains □ and we have shown that the original set of clauses is unsatisfiable, or □ is not in C; in the latter case we may conclude that C is satisfiable. This is the general principle of resolution decision procedures (for a thorough treatment of this topic see [Fermüller et al., 1993]) . As unrefined resolution shows a quite bad termination behavior, resolution decision procedures are mostly based on refinements. Here not only the correctness but also the completeness of refinements are required in order to ensure the correctness of the decision procedure. Once we have found out that the original set of clauses D is satisfiable we may use the computed fixed point set C for constructing a model of D this is basically the approach to model building we are following in this chapter.
KeywordsLime Lution Reso Verse Guaran
Unable to display preview. Download preview PDF.