cs.LO · 2026-10-14 · No. 143
Logic in Computer Science, 2026-10-14.
1 new papers in cs.LO. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
1 entries-
01
Reset Early, Reset Often, Eliminate Models
Martin S. Fixman, Fredrik Rømming, Sean B. Holden
cs.LO · cs.AI
Connection-tableau provers typically construct closed tableaux by backtracking search. This gives lightweight proof procedures, but their low-memory search state leaves little derived information to reuse after a failed attempt. SATCoP addresses this by retaining grounded tableau clauses in an incremental SAT solver, allowing the prover to refute the problem once the accumulated ground clauses become propositionally unsatisfiable. We...
This edition is part of The Daily Abstract — cs.LO archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.