Exotic Semi-Ring Constraints

Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann

Research output: Contribution to conferencePaperpeer-review


Exotic semiring constraints arise in a variety of applications and in particular in the context of automated termination analysis. We propose two techniques to solve such constraints: (a) to model them using Boolean functions and integer linear arithmetic and solve them using an SMT solver (QF LIA, in certain cases also QF IDL); and (b) to seek finite domain solutions by applying unary bit-blasting and solve them using a SAT solver. In this note, we show the structure of such systems of constraints, and report on the performance of SMT solvers and SAT encodings when solving them. In particular, we observe that good results are obtained by unary bit-blasting, improving on previous proposals to apply binary bit-blasting. Moreover, our results indicate that, for our benchmarks, unary bit-blasting leads to better results than the ones directly obtained by an SMT solver.
Original languageEnglish GB
Number of pages10
StatePublished - 2012
Event10th International Workshop on Satisfiability Modulo Theories - Manchester, United Kingdom
Duration: 30 Jun 20121 Jul 2012


Conference10th International Workshop on Satisfiability Modulo Theories
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Exotic Semi-Ring Constraints'. Together they form a unique fingerprint.

Cite this