A finite state intersection approach to propositional satisfiability

DOI10.1016/J.TCS.2012.04.030zbMATH Open1243.68272OpenAlexW2001123191MaRDI QIDQ442157FDOQ442157

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

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.030

Recommendations

• Variable and clause ordering in an FSA approach to propositional satisfiability
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 2084702
• Symbolic techniques in satisfiability solving
• Exact DFA Identification Using SAT Solvers

zbMATH Keywords

model countingALL-SATFSA intersectionintersection grammars (FSIG)regular expression compilation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Cites Work

• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The state complexities of some basic operations on regular languages
• Hard examples for resolution
• A geometric hierarchy beyond context-free languages
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
• Automata-theoretic techniques for modal logics of programs
• On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
• The emptiness problem for intersections of regular languages
• Algorithms for the maximum satisfiability problem
• Extended Resolution Proofs for Conjoining BDDs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable and clause ordering in an FSA approach to propositional satisfiability
• Implementation and Application of Automata
• Counter-free automata, first-order logic, and star-free expressions extended by prefix oracles

Cited In (2)

• Title not available (Why is that?)
• Variable and clause ordering in an FSA approach to propositional satisfiability

Uses Software

• SBSAT
• FORCE
• sharpSAT

This page was built for publication: A finite state intersection approach to propositional satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442157)