Finding first-order minimal unsatisfiable cores with a heuristic depth-first-search algorithm

Authors:
Jianmin Zhang;Weixia Xu;Jun Zhang;Shengyu Shen;Zhengbin Pang;Tiejun Li;Jun Xia;Sikun Li
Affiliations:
School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China
Venue:
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
Year:
2011

Citing 14
Cited 0

AMUSE: a minimally-unsatisfiable subformula extractor

Proceedings of the 41st annual Design Automation Conference
Word level predicate abstraction and refinement for verifying RTL verilog

Proceedings of the 42nd annual Design Automation Conference
Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Boosting a complete technique to find MSS and MUS thanks to a local search oracle

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas

Constraints
Conformant planning via heuristic forward search: A new approach

Artificial Intelligence
A simple and flexible way of computing small unsatisfiable cores in SAT modulo theories

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Finding guaranteed MUSes fast

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Efficient combination of decision procedures for MUS computation

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Boosting minimal unsatisfiable core extraction

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
On finding all minimally unsatisfiable subformulas

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Deriving small unsatisfiable cores with dominators

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
An incremental and layered procedure for the satisfiability of linear arithmetic logic

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.