Journal of the ACM (JACM)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
Elements of the Theory of Computation
Elements of the Theory of Computation
The Emptiness Problem for Intersections of Regular Languages
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
FORCE: a fast and easy-to-implement variable-ordering heuristic
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Computational complexity in two-level morphology
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Introduction to Mathematics of Satisfiability
Introduction to Mathematics of Satisfiability
Logic and automata: a match made in heaven
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
sharpSAT: counting models with advanced component caching and implicit BCP
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
| Hi-index | 0.00 |
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 construction, we obtain an ALL-SAT solver and model counter. We compare how several variable ordering (state ordering) heuristics affect the running time of the FSA construction. We also present a strategy for clause ordering (automata composition). We compare the running time of state-of-the-art model counters, BDD based sat solvers and we show that this FSA approach obtains state-of-the-art performance on some hard unsatisfiable benchmarks. This work brings up many questions on the possible use of automata to address SAT.