arXiv:2610.18204v1 Announce Type: cross
Abstract: Connection-tableau provers typically construct closed tableaux by backtracking search. This gives lightweight proof procedures, but their low-memory...
By Martin S. Fixman, Fredrik R{\o}mming, Sean B. Holden
arXiv:2607. 00815v1 Announce Type: cross Abstract: SAT solvers settle combinatorial problems beyond the reach of interactive theorem provers and produce LRAT certificates for independent verification.
By Stefan Szeider
arXiv:2606. 03655v1 Announce Type: new Abstract: Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al.
By Nicholas Leisegang, Thomas Meyer, Ivan Varzniczak
arXiv:2606. 06641v1 Announce Type: new Abstract: We present Accelerated Fourier SAT (AFSAT), a GPU-accelerated solver for pseudo-Boolean satisfiability based on continuous local search (CLS).
By Cody J Christopher, Charles Gretton
The paper introduces a hybrid framework for solving Satisfiability Modulo the Theory of Nonlinear Real Arithmetic (SMT‑NRA). It presents a new two‑dimensional cell‑jump move, called 2D‑cell‑jump, that generalizes the existing cell‑jump operation by allowing search over any chosen plane. Building on this, the authors develop an extended local search framework, 2D‑LS, and combine it with MCSAT and OpenCAD to form a hybrid solver that improves search efficiency through information exchange, as shown by experimental results.
By Tianyi Ding, Haokun Li, Xinpeng Ni, Bican Xia, Tianqi Zhao
Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics.