3 research outputs found
SAT-Based Subsumption Resolution
Subsumption resolution is an expensive but highly effective simplifying
inference for first-order saturation theorem provers. We present a new
SAT-based reasoning technique for subsumption resolution, without requiring
radical changes to the underlying saturation algorithm. We implemented our work
in the theorem prover Vampire, and show that it is noticeably faster than the
state of the art
Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design – FMCAD 2021
The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing