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

03/29/2023
by   Enrico Lipparini, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/28/2017

Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem

In this paper, we propose an algorithm for the positive one-in-three sat...
research
03/25/2019

Faster Random k-CNF Satisfiability

We describe an algorithm to solve the problem of Boolean CNF-Satisfiabil...
research
01/26/2018

Satisfiability Modulo Transcendental Functions via Incremental Linearization

In this paper we present an abstraction-refinement approach to Satisfiab...
research
01/24/2022

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

In a previous paper, we have shown that clause sets belonging to the Hor...
research
04/20/2018

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems

We present a combination of the Mixed-Echelon-Hermite transformation and...
research
07/07/2021

A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

The Bernays-Schönfinkel first-order logic fragment over simple linear re...
research
01/21/2021

Improved Algorithms for the General Exact Satisfiability Problem

The Exact Satisfiability problem asks if we can find a satisfying assign...

Please sign up or login with your details

Forgot password? Click here to reset