Complete sat solvers for many-valued cnf formulas
- Felip Manyà Serres Director/a
Universidad de defensa: Universitat de Lleida
Fecha de defensa: 09 de julio de 2004
- Reiner Hähnle Presidente/a
- Ramón Béjar Torres Secretario
- Carla Gomes Vocal
- César Fernández Camón Vocal
- Min Li Chu Vocal
Tipo: Tesis
Resumen
SATS is formally defined as the problem of deciding the satisfiability of a class of many-valued clausal forms called Signed CNF formulas (S-formulas). An S-formula is a classical propositional conjunctive clause form based on a generalised notion of literal, called S-literal. Given a domain N