A finite state intersection approach to propositional satisfiability
type: Item
instance of: scholarly article
title: A finite state intersection approach to propositional satisfiability
zbMATH Open document ID: 1243.68272
author: José M. Castaño
author: Rodrigo Castaño
published in: Theoretical Computer Science
publication date: 2012-08-09T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 6064531
zbMATH Keywords: ALL-SAT
zbMATH Keywords: model counting
zbMATH Keywords: FSA intersection
zbMATH Keywords: regular expression compilation
zbMATH Keywords: intersection grammars (FSIG)
describes a project that uses: sharpSAT
describes a project that uses: SBSAT
describes a project that uses: FORCE
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.04.030
OpenAlex ID: W2001123191
cites work: Q5503674
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability
cites work: Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
cites work: Decision Problems of Finite Automata Design and Related Arithmetics
cites work: Theory and Applications of Satisfiability Testing
cites work: Q4198056
cites work: Q3503197
cites work: Algorithms for the maximum satisfiability problem
cites work: Q3862379
cites work: On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
cites work: The emptiness problem for intersections of regular languages
cites work: Q4217604
cites work: Q5485993
cites work: Extended Resolution Proofs for Conjoining BDDs
cites work: Hard examples for resolution
cites work: Q4449164
cites work: Automata-theoretic techniques for modal logics of programs
cites work: A geometric hierarchy beyond context-free languages
cites work: Implementation and Application of Automata
cites work: The state complexities of some basic operations on regular languages
DOI: 10.1016/J.TCS.2012.04.030
description: scientific article; zbMATH DE number 6064531