A System for Solving Constraint Satisfaction Problems with SMT

DOI10.1007/978-3-642-14186-7_25zbMath1306.68153OpenAlexW1504520037WikidataQ57979701 ScholiaQ57979701MaRDI QIDQ4930597

Mateu Villaret, Miquel Bofill, Josep Suy

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)

Related Items (4)

Auto-tabling for subproblem presolving in MiniZinc ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ meSAT: multiple encodings of CSP to SAT

Uses Software

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

This page was built for publication: A System for Solving Constraint Satisfaction Problems with SMT