Abstract

Explaining the causes of infeasibility of formulas has practical applications in various fields, such as artificial intelligence and formal verification. A minimal unsatisfiable core provides a succinct explanation of infeasibility and is valuable for applications. The problem of deriving minimal unsatisfiable cores from Boolean formulas has been addressed rather frequently in recent years. However little attention has been concentrated on extraction of the first-order unsatisfiable subformulas. In this paper, we present DFS-Finder, which finds minimal unsatisfiable cores in first-order logic, adopting a heuristic depth-first-search strategy. We demonstrate the effectiveness of this approach on a very extensive test of SMT-LIB benchmarks.

Full Text
Paper version not known

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 call

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.