2020
DOI: 10.1007/978-3-030-58475-7_9
|View full text |Cite
|
Sign up to set email alerts
|

Effective Encodings of Constraint Programming Models to SMT

Abstract: Satisfiability Modulo Theories (SMT) is a well-established methodology that generalises propositional satisfiability (SAT) by adding support for a variety of theories such as integer arithmetic and bit-vector operations. SMT solvers have made rapid progress in recent years. In part, the efficiency of modern SMT solvers derives from the use of specialised decision procedures for each theory. In this paper we explore how the Essence Prime constraint modelling language can be translated to the standard SMT-LIB la… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…The SMT backend is described and evaluated in a CP 2020 paper [6], including comparison of the four theories and two encodings.…”
Section: Remove Redundant Variablesmentioning
confidence: 99%
“…The SMT backend is described and evaluated in a CP 2020 paper [6], including comparison of the four theories and two encodings.…”
Section: Remove Redundant Variablesmentioning
confidence: 99%