Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability

DOI10.1007/978-3-642-22256-6_8zbMath1297.68111OpenAlexW117878442MaRDI QIDQ5200054

José M. Castaño, Rodrigo Castaño

Publication date: 29 July 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_8

zbMATH Keywords

model countingALL-SATFSA intersectionregular expression compilation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

A finite state intersection approach to propositional satisfiability

Uses Software

• SBSAT
• FORCE
• sharpSAT

Cites Work

• Algorithms for the maximum satisfiability problem
• Automata-theoretic techniques for modal logics of programs
• Weak Second‐Order Arithmetic and Finite Automata
• Extended Resolution Proofs for Conjoining BDDs
• Hard examples for resolution
• Theory and Applications of Satisfiability Testing

This page was built for publication: Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability