Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions

DOI10.1007/978-3-319-09284-3_25zbMath1423.68457OpenAlexW1569885273MaRDI QIDQ3192080

Daniel Larraz, Enric Rodríguez-Carbonell, Albert Oliveras, Albert Rubio

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_25

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Proving Termination Through Conditional Termination ⋮ Learning modulo theories for constructive preference elicitation ⋮ Structured learning modulo theories ⋮ Extended Nested Dual System Groups, Revisited ⋮ Delegatable Functional Signatures ⋮ Optimization modulo the theories of signed bit-vectors and floating-point numbers ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Speeding up the Constraint-Based Method in Difference Logic ⋮ Optimization modulo the theory of floating-point numbers

Uses Software

• z3
• dReal
• HSF
• SMT-RAT
• CalCS

This page was built for publication: Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions