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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.04.030 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: sharpSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SBSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FORCE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001123191 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.04.030 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:45, 9 December 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