Scholarlink

<p>We present an automated prover for coherent logic with function symbols which uses the power of SMT solvers through the recently proposed paradigm “theorem proving as constraint solving”. The open-source implementation of the prover supports export of proofs in natural language and to the proof assistants Coq, Isabelle, and Mizar, and has other additional features such as the support for completing premises, goals, partially given proofs, and the support for creating illustrated proofs.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Theorem Proving as Constraint Solving for Coherent Logic with Function Symbols

  • 期刊论文

  • 发表日期：

    2025年10月16日

查看全文
  • Predrag Janičić

摘要

We present an automated prover for coherent logic with function symbols which uses the power of SMT solvers through the recently proposed paradigm “theorem proving as constraint solving”. The open-source implementation of the prover supports export of proofs in natural language and to the proof assistants Coq, Isabelle, and Mizar, and has other additional features such as the support for completing premises, goals, partially given proofs, and the support for creating illustrated proofs.