A Modular Approach to MaxSAT Modulo Theories

DOI10.1007/978-3-642-39071-5_12zbMath1390.68572OpenAlexW89830494WikidataQ62041163 ScholiaQ62041163MaRDI QIDQ5326459

Roberto Sebastiani, Alberto Griggio, Bastiaan Joost Schaafsma, Alessandro Cimatti

Publication date: 5 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_12

Mathematics Subject Classification ID

Related Items (8)

Fast, flexible MUS enumeration ⋮ Optimization Modulo Theories with Linear Rational Costs ⋮ Learning modulo theories for constructive preference elicitation ⋮ Structured learning modulo theories ⋮ Delegatable Functional Signatures ⋮ Optimization modulo the theories of signed bit-vectors and floating-point numbers ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• z3
• MathSAT5

This page was built for publication: A Modular Approach to MaxSAT Modulo Theories