Spass-Satt

Bromberger, Martin; Fleury, Mathias; Schwarz, Simon; Weidenbach, Christoph

doi:10.1007/978-3-030-29436-6_7

Cited by 5 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that this procedure is only complete for Horn clauses. For arithmetic reasoning, SPASS-SPL relies on SPASS-SATT, our sound and complete CDCL(LA) solver for quantifier-free linear real and linear mixed/integer arithmetic [12]. SPASS-SATT implements a version of the dual simplex algorithm fine-tuned towards SMT solving [16].…”

Section: Experimentationmentioning

confidence: 99%

An Efficient Subsumption Test Pipeline for BS(LRA) Clauses

Bromberger

Leutgeb

Weidenbach

2022

Automated Reasoning

Self Cite

View full text Add to dashboard Cite

The importance of subsumption testing for redundancy elimination in first-order logic automatic reasoning is well-known. Although the problem is already NP-complete for first-order clauses, the meanwhile developed test pipelines efficiently decide subsumption in almost all practical cases. We consider subsumption between first-oder clauses of the Bernays-Schönfinkel fragment over linear real arithmetic constraints: BS(LRA). The bottleneck in this setup is deciding implication between the LRA constraints of two clauses. Our new sample point heuristic preempts expensive implication decisions in about 94% of all cases in benchmarks. Combined with filtering techniques for the first-order BS part of clauses, it results again in an efficient subsumption test pipeline for BS(LRA) clauses.

show abstract

Section: Experimentationmentioning

confidence: 99%

An Efficient Subsumption Test Pipeline for BS(LRA) Clauses

Bromberger

Leutgeb

Weidenbach

2022

Automated Reasoning

Self Cite

View full text Add to dashboard Cite

show abstract

“…The most popular approach is the lazy approach [3,41], also known as DPLL(T) [38], which is a central development of SMT. Many DPLL(T) solvers have been developed for SMT (LIA) [7,19] and SMT (IDL) [31,37,47]. In this approach, the formula is abstracted into a Boolean formula by replacing arithmetic atomic formulae with fresh Boolean variables.…”

Section: Introductionmentioning

confidence: 99%

“…A theory solver called SPASS-IQ was designed to efficiently handle unbounded problems [6,8]. According to recent SMT Competitions, 1 almost all state-of-the-art SMT (LIA) and SMT (IDL) solvers are based on the lazy approach, including MathSAT5 [15], CVC5 [2], Yices2 [21], Z3 [18], SMTInterpol [14] and SPASS-SATT [7].…”

Section: Introductionmentioning

confidence: 99%

Local Search for SMT on Linear Integer Arithmetic

Zhang

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Satisfiability Modulo Linear Integer Arithmetic, SMT (LIA) for short, has significant applications in many domains. In this paper, we develop the first local search algorithm for SMT (LIA) by directly operating on variables, breaking through the traditional framework. We propose a local search framework by considering the distinctions between Boolean and integer variables. Moreover, we design a novel operator and scoring functions tailored for LIA, and propose a two-level operation selection heuristic. Putting these together, we develop a local search SMT (LIA) solver called LS-LIA. Experiments are carried out to evaluate LS-LIA on benchmarks from SMTLIB and two benchmark sets generated from job shop scheduling and data race detection. The results show that LS-LIA is competitive and complementary with state-of-the-art SMT solvers, and performs particularly well on those formulae with only integer variables. A simple sequential portfolio with Z3 improves the state-of-the-art on satisfiable benchmark sets of LIA and IDL benchmarks from SMT-LIB. LS-LIA also solves Job Shop Scheduling benchmarks substantially faster than traditional complete SMT solvers.

show abstract