Complete Sat Solvers for Many-Valued CNF formulas

Autor: Ansótegui Gil Carlos José
Año: 2003
Universidad: LLEIDA
Centro de realización: Escola Politècnica Superior
Centro de lectura: Escola Politècnica Superior
Director: Manyà Serres Felip
Tribunal: Hähnle Reiner , Fernández Camón César , Gomes Carla , Li Chu Min , Béjar Torres Ramón
Resumen de la tesis

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
Materias relacionadas