Complete sat solvers for many-valued cnf formulas

  1. Ansótegui Gil, Carlos José
Dirigida por:
  1. Felip Manyà Serres Director/a

Universidad de defensa: Universitat de Lleida

Fecha de defensa: 09 de julio de 2004

Tribunal:
  1. Reiner Hähnle Presidente/a
  2. Ramón Béjar Torres Secretario
  3. Carla Gomes Vocal
  4. César Fernández Camón Vocal
  5. Min Li Chu Vocal

Tipo: Tesis

Teseo: 106868 DIALNET

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