In First order Logic linear resolution is complete. So, either linear resolution finds the empty clause or it halts.
But what assures us that linear resolution halts in a finite number of iterations if the set of clauses is satisfiable ?
In First order Logic linear resolution is complete. So, either linear resolution finds the empty clause or it halts.
But what assures us that linear resolution halts in a finite number of iterations if the set of clauses is satisfiable ?
Copyright © 2021 JogjaFile Inc.