scientific article
From MaRDI portal
Publication:3075241
zbMath1211.68371MaRDI QIDQ3075241
Christoph Benzmüller, Geoff Sutcliffe
Publication date: 10 February 2011
Full work available at URL: http://jfr.cib.unibo.it/article/view/1710
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (23)
Cut-elimination for quantified conditional logic ⋮ MaLeS: a framework for automatic tuning of automated theorem provers ⋮ The higher-order prover \textsc{Leo}-II ⋮ LeoPARD — A Generic Platform for the Implementation of Higher-Order Reasoners ⋮ Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics ⋮ Extensional higher-order paramodulation in Leo-III ⋮ Embedding and automating conditional logics in classical higher-order logic ⋮ The MET: The Art of Flexible Reasoning with Modalities ⋮ The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 ⋮ Solving modal logic problems by translation to higher-order logic ⋮ Higher-Order Modal Logics: Automation and Applications ⋮ Combining and automating classical and non-classical logics in classical higher-order logics ⋮ Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners) ⋮ Translating between Language and Logic: What Is Easy and What Is Difficult ⋮ Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems ⋮ Automating free logic in HOL, with an experimental application in category theory ⋮ Extracting Higher-Order Goals from the Mizar Mathematical Library ⋮ Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems ⋮ Internal Guidance for Satallax ⋮ Effective Normalization Techniques for HOL ⋮ Automating Free Logic in Isabelle/HOL ⋮ Reducing higher-order theorem proving to a sequence of SAT problems ⋮ Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
Uses Software
This page was built for publication: