A finite state intersection approach to propositional satisfiability (Q442157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The emptiness problem for intersections of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Resolution Proofs for Conjoining BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric hierarchy beyond context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Revision as of 12:42, 5 July 2024

scientific article
Language Label Description Also known as
English
A finite state intersection approach to propositional satisfiability
scientific article

    Statements

    A finite state intersection approach to propositional satisfiability (English)
    0 references
    0 references
    0 references
    9 August 2012
    0 references
    ALL-SAT
    0 references
    model counting
    0 references
    FSA intersection
    0 references
    regular expression compilation
    0 references
    intersection grammars (FSIG)
    0 references
    0 references
    0 references
    0 references

    Identifiers