arXiv:2606. 31878v1 Announce Type: cross Abstract: We investigate two approaches for extending CEGAR-tableaux with SAT-shortcuts using a previously known approach called RECAR but also a totally new approach using the modal resolution theorem prover KSP as an oracle.
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...
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.
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.
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).
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.
Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics.
arXiv:2606. 06656v1 Announce Type: new Abstract: We study parallel Continuous Local Search (CLS) as a solution approach for Boolean satisfiability problems with symmetric pseudo-Boolean (PB) constraints.
arXiv:2608.28639v1 Announce Type: new Abstract: Formal theorem proving with large language models remains challenging due to the difficulty of navigating large proof search spaces efficiently. Existi...
Whiel is a Lean‑certified neurosymbolic platform for reasoning about imperative relational programs. It encodes containment and equivalence for Datalog, its negated extensions, and core graph query fragments, and can represent optimized evaluation algorithms and first‑order specifications of integrity constraints, schema mappings, and views. The system uses Hoare‑style reasoning with prophecy variables and leveled invariants, and supports neurosymbolic discovery of loop invariants verified by the Vampire theorem prover, with counterexamples fed back into the pipeline and solutions translated into Lean proof certificates.
arXiv:2608. 15143v1 Announce Type: new Abstract: Constraint solving is a declarative approach for solving combinatorial satisfaction and optimization problems.
arXiv:2607. 20022v1 Announce Type: new Abstract: Difference constraints of the form $x - y \leq d$ are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths.
arXiv:2607.00815v2 Announce Type: replace-cross Abstract: If the certificate produced by a SAT solver is checked by a verified checker, we get a verdict which convinces. But this verdict cannot be na...