Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: First-order coherent logic (CL) extends resolution logic in that coherent formulas allow certain existential quantifications. A substantial number of reasoning problems (e.g., in confluence theory, lattice theory and projective geometry) can be formulated directly in CL without any clausification or Skolemization. CL has a natural proof theory, reasoning is constructive and proof objects can easily be obtained.  prove completeness of the proof theory and give a linear translation from FOL to CL that preserves logical equivalence. These properties make CL ll-suited for providing automated reasoning support to logical frameworks. The proof theory has been implemented in Prolog, generating proof objects that can be verified directly in the proof assistant Coq. The prototype has been tested on the proof of Hessenberg’s Theorem, which could be automated to a considerable extent. Finally,  compare the prototype to some automated theorem provers on selected problems.
['Marc Bezem', 'Thierry Coquand']
I am writing a research paper on a idea Automating coherent logic
[{"from": "human", "value": "I am writing a research paper on a idea Automating coherent logic"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: First-order coherent logic (CL) extends resolution logic in that coherent formulas allow certain existential quantifications. A substantial number of reasoning problems (e.g., in confluence theory, lattice theory and projective geometry) can be formulated directly in CL without any clausification or Skolemization. CL has a natural proof theory, reasoning is constructive and proof objects can easily be obtained.  prove completeness of the proof theory and give a linear translation from FOL to CL that preserves logical equivalence. These properties make CL ll-suited for providing automated reasoning support to logical frameworks. The proof theory has been implemented in Prolog, generating proof objects that can be verified directly in the proof assistant Coq. The prototype has been tested on the proof of Hessenberg\u2019s Theorem, which could be automated to a considerable extent. Finally,  compare the prototype to some automated theorem provers on selected problems."}]