Journal of the ACM (JACM)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
A geometric hierarchy beyond context-free languages
Theoretical Computer Science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Grammars with controlled derivations
Handbook of formal languages, vol. 2
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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
On the complexity of intersecting finite state automata and NL versus NP
Theoretical Computer Science
Computational complexity in two-level morphology
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Recognition of linear context-free rewriting systems
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
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
Parsing Techniques: A Practical Guide
Parsing Techniques: A Practical Guide
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
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
Hi-index | 5.23 |
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 construction, we obtain an ALL-SAT solver and model counter. This automata construction can be considered essentially a finite state intersection grammar (FSIG). We also show how an FSIG approach can be encoded. Several variable ordering (state ordering) heuristics are compared in terms of the running time of the FSA and FSIG construction. We also present a strategy for clause ordering (automata composition). Running times of state-of-the-art model counters and BDD based SAT solvers are compared and we show that both the FSA and FSIG approaches obtain an state-of-the-art performance on some hard unsatisfiable benchmarks. It is also shown that clause learning techniques can help improve performance. This work brings up many questions on the possible use of automata and grammar models to address SAT.