Abstract
The current first-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus which is quite slow and memory intensive. In this paper, an improved version of FAUST using a modified form of tableau calculus called Tableau Graph Calculus is presented which overcomes the well-known inefficiencies of the traditional tableau calculus to a large extent. This calculus works on a compact representation of analytic tableaux called tableau graphs which are obtained by a preprocessing step which covers most of the rule applications of usual tableau calculus. This representation retains the clarity of the input formula and furthermore, its size is linear with respect to the length of the input formula. As a result of this preprocessing, our calculus has only one single rule which is repeatedly applied to obtain a proof. Many optimizations for the rule applications to effectively prune the search space are presented as well and are currently being implemented in a new version of FAUST.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Higher Order Logic Theorem Proving and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
