A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
EasyChair Preprint Unification with Abstraction and Theory Instantiation in Saturation-based Reasoning Unification with Abstraction and Theory Instantiation in Saturation-based Reasoning *
2017
unpublished
This paper explores two new inference rules for reasoning with quantifiers and theories in a saturation-based first-order theorem prover. The focus here is on non-ground clauses, complementing our recent work on AVATAR modulo theories for ground theory reasoning. The current implementation focuses on complete theories, e.g. various versions of arithmetic, but we also sketch how to work with incomplete theories. The first new rule utilises theory constraint solving (an SMT solver) to perform
fatcat:756jur7hhvgb7nxw6fyh63odji