Talks and Poster Presentations (without Proceedings-Entry):
G. Reger, M. Suda:
"Revisiting Global Subsumption";
Talk: The Third Vampire Workshop, VAMPIRE 2016,
Global Subsumption is a simplification technique for saturation-based first-order theorem provers. The general idea is that we can replace a clause C by its subclause D if D follows from the initial problem as D will subsume C. The effectiveness of the technique comes from an effective approach for (incompletely) checking whether D is a consequence of the initial problem. Here the idea is to produce and maintain a set S of ground clauses that follow from the input (e.g. grounded versions of all derived clauses) and to check whether a grounding of D follows from this set. As this is now a propositional problem this check can be performed by a SAT solver, making it efficient. In this paper we review the global subsumption technique and consider various extensions and their implementations in the Vampire theorem prover. We consider, for example, which groundings to place in S, how to select the subclause(s) D to check, how to integrate this technique with the AVATAR approach and whether it makes sense to replace the SAT solver with a SMT solver.
Automated theorem proving, global subsumption
Created from the Publication Database of the Vienna University of Technology.