Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem

0574098 - ÚI 2024 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Lipparini, E. - Ratschan, Stefan
Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem.
NASA Formal Methods: 15th International Symposium, NFM 2023 Proceedings. Cham: Springer, 2023 - (Rozier, K.; Chaudhuri, S.), s. 472-488. Lecture Notes in Computer Science, 13903. ISBN 978-3-031-33169-5. ISSN 0302-9743.
[NFM 2023: NASA Formal Methods International Symposium /15./. Houston (US), 16.05.2023-18.05.2023]
Grant CEP: GA ČR(CZ) GA21-09458S
Institucionální podpora: RVO:67985807
Klíčová slova: SAT modulo theories * constraint solving * formal verification
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://dx.doi.org/10.1007/978-3-031-33170-1_29

For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic with transcendental functions, however, no general finite representation of satisfying assignments is available. Hence, in this paper, we introduce a different form of satisfiability certificate for this theory, formulate the satisfiability verification problem as the problem of searching for such a certificate, and show how to perform this search in a systematic fashion. This does not only ease the independent verification of results, but also allows the systematic design of new, efficient search techniques. Computational experiments document that the resulting method is able to prove satisfiability of a substantially higher number of benchmark problems than existing methods.
Trvalý link: https://hdl.handle.net/11104/0344454