What's hard about Boolean functional synthesis? (Q6045007)

From MaRDI portal
Revision as of 05:39, 10 July 2024 by Import240710060729 (talk | contribs) (Added link to MaRDI item.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7689213
Language Label Description Also known as
English
What's hard about Boolean functional synthesis?
scientific article; zbMATH DE number 7689213

    Statements

    title
    What's hard about Boolean functional synthesis? (English)
    0 references
    author
    S. Akshay
    0 references
    Supratik Chakraborty
    0 references
    Shubham Goel
    0 references
    Sumith Kulal
    0 references
    Shetal Shah
    0 references
    publication date
    26 May 2023
    0 references
    zbMATH Keywords
    Skolem functions
    0 references
    synthesis
    0 references
    SAT solvers
    0 references
    CEGAR-based approach
    0 references

    Identifiers

    arXiv ID
    1804.05507
    0 references
    Mathematics Subject Classification ID
    68Q60
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7689213
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6045007&oldid=35465255"
    Powered by MediaWiki