Buscar
Mostrando ítems 1-1 de 1
Ponencia
PURL: A new polynomial-time solvable class of satisfiability
(Universidad de Cádiz, 2007)
In this work a new polynomial-time solvable class of satisfiability PURL ( PropUnit RemoveLiterals) is presented, based on natural extensions of the known con cepts of the l-neighbourhood of a clause and removable literal. ...