SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving

2017 IEEE International Conference on Information Reuse and Integration (IRI)

Niemueller

et al. 2017

In manufacturing, the increasing involvement of autonomous robots in production processes poses new challenges on the production management. In this paper we report on the usage of Optimization Modulo Theories (OMT) to solve certain multi-robot scheduling problems in this area. Whereas currently existing methods are heuristic, our approach guarantees optimality for the computed solution. We do not only present our final method but also its chronological development, and draw some general observations for the development of OMT-based approaches.

Section: Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Synthesis of Guaranteed-Quality Plans for Robot Fleets in Logistics Scenarios via Optimization Modulo Theories

Leofante

2017 IEEE International Conference on Information Reuse and Integration (IRI)

Niemueller

et al. 2017

“…Examples for solvers that are able to cope with linear arithmetic problems (either in a complete or in an incomplete manner) are Alt-Ergo [26], CVC4 [4], iSAT3 [36,53], MathSAT [22], OpenSMT2 [19], SMT-RAT [28], veriT [13], Yices2 [34], and Z3 [48]. A further interesting SMT-approach for linear integer arithmetic is proposed in [16].…”

Section: Satisfiability Checkingmentioning

confidence: 99%

$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation

Lecture Notes in Computer Science

Abbott

Becker

et al. 2016

Self Cite

Abstract. Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC 2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC 2 community.

“…Though relevant progress has been made recently in SMT solving for non-linear arithmetic (e.g. [16,13]), current approaches do not yet fully satisfy the needs of formal verification tools.…”

Section: A Few Challenges and Recent Advancesmentioning

confidence: 99%

“…For example, incomplete but fast Interval Arithmetic can be used to reduce the search space, the Simplex method to check the linear part of the problem for satisfiability, or the Virtual Substitution method to eliminate variables that appear quadratically with less effort. A unique feature of the SMT-RAT solver [13] is that it allows the user to define her own strategic combination of decision procedures, optimised towards the given problem type, and with the possibility to exploit parallelisation.…”

Section: A Few Challenges and Recent Advancesmentioning

confidence: 99%

SC-square: when Satisfiability Checking and Symbolic Computation join forces

EPiC Series in Computing

Abbott

Becker

et al.

Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but with common interests, e.g., in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of the SC 2 initiative is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications.