A finite state intersection approach to propositional satisfiability

Mostrar todas las versiones(3)

We use a finite state (FSA) construction approach to address the problem of propositional satisfiability (SAT). We present 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 cons...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Castaño, J.M., Castaño, R.
Formato: Artículo publishedVersion
Publicado: 2012
Materias:
ALL-SAT
FSA intersection
Intersection grammars (FSIG)
Model counting
Regular expression compilation
Automata composition
Clause learning
Conjunctive normal forms
Construction approaches
Finite state
Propositional satisfiability
Regular expressions
Running time
SAT solvers
Several variables
State-of-the-art performance
Benchmarking
Boolean functions
Decision theory
Pattern matching
Finite automata
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03043975_v450_n_p92_Castano
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v450_n_p92_Castano_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares