Por motivos de mantenimiento se ha deshabilitado el inicio de sesión temporalmente. Rogamos disculpen las molestias.
Ponencia
PURL: A new polynomial-time solvable class of satisfiability
Autor/es | Portillo Fernández, José Ramón
Rodrigues, J. I. |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2007 |
Fecha de depósito | 2022-07-29 |
Publicado en |
|
ISBN/ISSN | 978-84-9828-133-0 |
Resumen | 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. ... 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. The algorithm Remove Literals is also shown which determines if a formula in PURL is satisfiable. The PURL class is a proper superset of all previously known polynomial-time solvable classes. The study of this class is motivated by the resolution of geometric problems. |
Agencias financiadoras | Junta de Andalucía |
Identificador del proyecto | PAI-FQM-0164 |
Cita | Portillo Fernández, J.R. y Rodrigues, J.I. (2007). PURL: A new polynomial-time solvable class of satisfiability. En V Encuentro andaluz de Matemática Discreta (195-202), La Línea de la Concepción, Cádiz: Universidad de Cádiz. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Páginas desde978-84-9828-133-0 ... | 3.425Mb | [PDF] | Ver/ | |