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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: REDLOG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974368544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination Properties with mu-term / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanically proving termination using polynomial interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Solving for Termination Analysis with Polynomial Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Techniques for Rational Polynomial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials over the reals in proofs of termination : from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing invariants for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-linear loop invariant generation using Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of Non-linear (Ir)rational Arithmetic / rank
 
Normal rank

Latest revision as of 11:49, 5 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers