SAT solving for variants of first-order subsumption

DOI10.1007/S10703-024-00454-1MaRDI QIDQ6911405zbMATH OpenFDO

Authors Jakob Rath, Michael G. Rawson, Armin Biere, Laura Kovács

Publication date 24 October 2025

Published in Formal Methods in System Design (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

saturationSAT solvingsubsumptionfirst-order theorem proving

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational aspects of satisfiability (68R07)

This page was built for publication: SAT solving for variants of first-order subsumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911405)