SAT modulo linear arithmetic for solving polynomial constraints (Q438576): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6062063 / rank
 
Normal rank
Property / zbMATH Keywords
 
non-linear arithmetic
Property / zbMATH Keywords: non-linear arithmetic / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint solving
Property / zbMATH Keywords: constraint solving / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial constraints
Property / zbMATH Keywords: polynomial constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
SAT modulo theories
Property / zbMATH Keywords: SAT modulo theories / rank
 
Normal rank
Property / zbMATH Keywords
 
termination
Property / zbMATH Keywords: termination / rank
 
Normal rank
Property / zbMATH Keywords
 
system verification
Property / zbMATH Keywords: system verification / rank
 
Normal rank

Revision as of 00:31, 30 June 2023

scientific article
Language Label Description Also known as
English
SAT modulo linear arithmetic for solving polynomial constraints
scientific article

    Statements

    SAT modulo linear arithmetic for solving polynomial constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2012
    0 references
    non-linear arithmetic
    0 references
    constraint solving
    0 references
    polynomial constraints
    0 references
    SAT modulo theories
    0 references
    termination
    0 references
    system verification
    0 references

    Identifiers