A system for solving constraint satisfaction problems with SMT

DOI10.1007/978-3-642-14186-7_25MaRDI QIDQ4930597zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Miquel Bofill, Josep Suy, Mateu Villaret

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14186-7_25

Mathematics Subject Classification ID

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

Recommendations

• Solving constraint satisfaction problems with SAT modulo theories
• Satisfiability modulo theories
• On SAT Modulo Theories and Optimization Problems
• Challenges in Satisfiability Modulo Theories
• Computer Aided Verification

Cited in

(9)

• Auto-tabling for subproblem presolving in MiniZinc
• \textsc{OptiMathSAT}: a tool for optimization modulo theories
• meSAT: multiple encodings of CSP to SAT
• Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint
• raSAT: An SMT Solver for Polynomial Constraints
• Solving generalized optimization problems subject to SMT constraints
• Constraint solving for finite model finding in SMT solvers
• Solving constraint satisfaction problems with SAT modulo theories
• SMTS: Distributed, Visualized Constraint Solving

Describes a project that uses

Uses Software

• SMT-LIB
• Yices
• MiniZinc
• FlatZinc
• SIMPLY

This page was built for publication: A system for solving constraint satisfaction problems with SMT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930597)