Computing Tiny Clause Normal Forms

DOI10.1007/978-3-642-38574-2_7zbMath1381.68256OpenAlexW1587163490MaRDI QIDQ4928432

Christoph Weidenbach, Noran Azmy

Publication date: 14 June 2013

Published in: Automated Deduction – CADE-24 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38574-2_7

Mathematics Subject Classification ID

Related Items (1)

Semi-intelligible Isar proofs from machine-generated proofs

Uses Software

• SPASS
• TPTP

This page was built for publication: Computing Tiny Clause Normal Forms