Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. Hover little attention has been concentrated on extraction of the first-order unsatisfiable subformulas. ,  present DFS-Finder, which finds minimal unsatisfiable cores in first-order logic, adopting a heuristic depth-first-search strategy.  demonstrate the effectiveness of this approach on a very extensive test of SMT-LIB benchmarks.
['Jianmin Zhang', 'Weixia Xu', 'Jun Zhang', 'ShengYu Shen', 'Zhengbin Pang', 'Tiejun Li', 'Jun Xia', 'Sikun Li']
I am writing a research paper on a idea Finding first-order minimal unsatisfiable cores with a heuristic depth-first-search algorithm
[{"from": "human", "value": "I am writing a research paper on a idea Finding first-order minimal unsatisfiable cores with a heuristic depth-first-search algorithm"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. Hover little attention has been concentrated on extraction of the first-order unsatisfiable subformulas. ,  present DFS-Finder, which finds minimal unsatisfiable cores in first-order logic, adopting a heuristic depth-first-search strategy.  demonstrate the effectiveness of this approach on a very extensive test of SMT-LIB benchmarks."}]