A parsing approach to SAT
We present a parsing approach to address the problem of propositional satisfiability (SAT). We use a very simple translation from formulae in conjunctive normal form (CNF) to strings to be parsed by an Earley type algorithm. The parsing approach enables both a SAT and an ALL-SAT solver. The parsing...
Guardado en:
| Publicado: |
2014
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8864_n_p3_Castano http://hdl.handle.net/20.500.12110/paper_03029743_v8864_n_p3_Castano |
| Aporte de: |
Ejemplares similares
-
A parsing approach to SAT
Publicado: (2014) -
A parsing approach to SAT
por: Castano, J.M. -
Variable and clause ordering in an FSA approach to propositional satisfiability
Publicado: (2011) -
Variable and clause ordering in an FSA approach to propositional satisfiability
por: Castaño, J.M., et al. -
A finite state intersection approach to propositional satisfiability
Publicado: (2012)