On Condensation of a Clause


In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correct proof of the relationship between subsumption and the existence of cliques in a total matcher graph. Next, we introduce the concept of width of a clique in a total matcher graph… (More)
DOI: 10.1007/978-3-540-39917-9_12

6 Figures and Tables


  • Presentations referencing similar topics