Variable and clause ordering in an FSA approach to propositional satisfiability

We use a finite state (FSA) construction approach to address the problem of propositional satisfiability (SAT). We use a very simple translation from formulas in conjunctive normal form (CNF) to regular expressions and use regular expressions to construct an FSA. As a consequence of the FSA construc...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Castaño, J.M., Castaño, R.
Formato: SER
Materias:
ALL-SAT
FSA intersection
model counting
regular expression compilation
Automata composition
Conjunctive normal forms
Finite state
Propositional satisfiability
Regular expressions
Running time
SAT solvers
Several variables
State-of-the-art performance
Boolean functions
Decision theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v6807LNCS_n_p76_Castano
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares