Autor:
Bonet, Maria Luisa

Foto de perfil
E-mails conocidos
bonet@lsi.upc.edu
Fecha de nacimiento
Proyectos de investigación
Unidades organizativas
Puesto de trabajo
Apellidos
Bonet
Nombre de pila
Maria Luisa
Nombre
Nombres alternativos
Afiliaciones conocidas
Universitat Politècnica de Catalunya, Spain
Páginas web conocidas
Página completa del ítem
Notificar un error en este autor

Filtros

20191
Restablecer filtros

Ajustes

Resultados de la búsqueda

Mostrando 1 - 1 de 1
  • Miniatura
    Artículo
    Satisfiability Solvers based on Resolution and Cutting Planes Proof Systems
    Bonet, Maria Luisa. Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019), 2019-09-02.
    Satisfiability (SAT) is the canonical NP-Complete problem. Many other interesting and practical problems can be encoded into SAT. This is why it is important from a theoretical and practical point of view. Nowadays there are very good algorithms to solve SAT, the best from the point of view of industrial instances can be shown equivalent to the proof system Resolution. We will present the algorithm, and the equivalence to Resolution. Other proof systems are more powerful than Resolution, and still might be amenable to finding refutation algorithms, like Cutting Planes. We will talk about posible ways to automatize Cutting Planes. Also we will present the dual-rail encoding of formulas, to be then refuted using MaxSAT algorithms, as another methodology for SAT more powerful than Resolution.