QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment-Reference-Cited by-同舟云学术

QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment

Published:2023 Issue: Volume: Page:78-95
ISSN:0302-9743
Container-title:Automated Deduction – CADE 29
language:
Short-container-title:

Author:

Bonacina Maria Paola,Graham-Lengrand Stéphane,Vauthier Christophe

Abstract

AbstractThis paper presents and proves totally correct a new algorithm, called

$$\textsf{QSMA}$$

QSMA , for the satisfiability of a quantified formula modulo a complete theory and an initial assignment. The optimized variant of

$$\textsf{QSMA}$$

QSMA implemented in YicesQS is described and shown to preserve total correctness. A report on the performance of YicesQS at the 2022 SMT competition is included. YicesQS ran in the

$$\textsf{LIA}$$

LIA ,

$$\textsf{NIA}$$

NIA ,

$$\textsf{LRA}$$

LRA ,

$$\textsf{NRA}$$

NRA , and

$$\textsf{BV}$$

BV categories and ranked second for the “largest contribution” award (single queries). It was the only solver to solve all

$$\textsf{LRA}$$

LRA instances, where it was about two orders of magnitude faster than the second best solver (Z3).

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-38499-8_5

Reference22 articles.

1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);E Althaus,2009

2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);P Baumgartner,2013

3. Bjørner, N., Janota, M.: Playing with quantified satisfaction (short paper). In: Fehnker, A., McIver, A., Sutcliffe, G., Voronkov, A. (eds.) Short Presentations at LPAR-20. EPiC Series in Computing, vol. 35, pp. 15–27. EasyChair (2015)

4. Bonacina, M.P., Graham-Lengrand, S., Shankar, N.: Conflict-driven satisfiability for theory combination: transition system and completeness. J. Autom. Reason. 64(3), 579–609 (2020). https://doi.org/10.1007/s10817-018-09510-y

5. Bonacina, M.P., Graham-Lengrand, S., Shankar, N.: CDSAT for nondisjoint theories with shared predicates: arrays with abstract length. In: Hyvärinen, A., Déharbe, D. (eds.) Proceedings of the SMT-20. CEUR Proceedings, vol. 3185, pp. 18–37. CEUR WS-org (2022)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantified Linear Arithmetic Satisfiability via Fine-Grained Strategy Improvement;Lecture Notes in Computer Science;2024