2000 character limit reached
Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic
Published 11 Aug 2021 in cs.LO | (2108.05320v1)
Abstract: We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit trivial proofs and how past formalisation attempts are not sufficient. We note that the new breed of local search based algorithms for this domain may offer an easier path forward.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.