Automating automated reasoning. The case of two generic automated reasoning tools
DOI10.1007/978-3-030-22102-7_29zbMATH Open1444.68290OpenAlexW2955191895MaRDI QIDQ2185494FDOQ2185494
Authors: Yoni Zohar, Dmitry Tishkovsky, Renate A. Schmidt, Anna Zamansky 
Publication date: 4 June 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-22102-7_29
Recommendations
- Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
- \textsc{MetTeL}: a tableau prover with logic-independent inference engine
- Formal verification of a generic framework to synthesize SAT-provers
- scientific article; zbMATH DE number 1543300
- An empirical analysis of modal theorem provers
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cited In (5)
- Automating the synthesis of decision procedures in a constructive metatheory
- Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- \textsc{MetTeL}: a tableau prover with logic-independent inference engine
- Using hints to increase the effectiveness of an automated reasoning program: Case studies
Uses Software
This page was built for publication: Automating automated reasoning. The case of two generic automated reasoning tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185494)
