88 citations · 340 across the 23 of their papers we have counts for
4 papers · 1 filter
Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results
Zhengbing Bian, Fabian Chudak, William Macready +3
Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms a…
OpenMath and SMT-LIB
James H. Davenport, Matthew England, Roberto Sebastiani +1
OpenMath and SMT-LIB are languages with very different origins, but both "represent mathematics". We describe SMT-LIB for the OpenMath community and consider adaptations for both l…
Satisfiability Modulo Transcendental Functions via Incremental Linearization
Alessandro Cimatti, Alberto Griggio, Ahmed Irfan +2
In this paper we present an abstraction-refinement approach to Satisfiability Modulo the theory of transcendental functions, such as exponentiation and trigonometric functions. The…
Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF
Alessandro Cimatti, Alberto Griggio, Ahmed Irfan +2
Model checking invariant properties of designs, represented as transition systems, with non-linear real arithmetic (NRA), is an important though very hard problem. On the one hand…