# On Optimization Modulo Theories, MaxSMT and Sorting Networks

@article{Sebastiani2017OnOM,
title={On Optimization Modulo Theories, MaxSMT and Sorting Networks},
author={R. Sebastiani and P. Trentin},
journal={ArXiv},
year={2017},
volume={abs/1702.02385}
}
• Published 2017
• Mathematics, Computer Science
• ArXiv
• Optimization Modulo Theories $$\text {OMT}$$ is an extension of SMT which allows for finding models that optimize given objectives. Partial weighted MaxSMT---or equivalently $$\text {OMT}$$ with Pseudo-Boolean objective functions, $$\text {OMT+PB}$$ --- is a very-relevant strict subcase of $$\text {OMT}$$. We classify existing approaches for MaxSMT or $$\text {OMT+PB}$$ in two groups: MaxSAT-based approaches exploit the efficiency of state-of-the-art MaxSAT solvers, but they are specific… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES