The ILTP problem library for intuitionistic logic

DOI10.1007/S10817-006-9060-ZzbMATH Open1113.68093OpenAlexW2127391555MaRDI QIDQ877897FDOQ877897

Jens Otten, Christoph Kreitz, Thomas Raths

Publication date: 4 May 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9060-z

Recommendations

• Automated Reasoning with Analytic Tableaux and Related Methods
• The ILLTP library for intuitionistic linear logic
• The QMLTP problem library for first-order modal logics
• The TPTP problem library
• TPTP, TSTP, CASC, etc.

zbMATH Keywords

Automated Theorem Proving

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• The TPTP problem library. CNF release v1. 2. 1
• Title not available (Why is that?)
• SATLIB: An online resource for research on SAT
• Title not available (Why is that?)
• Title not available (Why is that?)
• The axioms of constructive geometry
• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Title not available (Why is that?)
• Contraction-free sequent calculi for intuitionistic logic
• An Intuitionistic Predicate Logic Theorem Prover
• Automated Reasoning with Analytic Tableaux and Related Methods
• Automated Reasoning with Analytic Tableaux and Related Methods

Cited In (21)

• Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
• Optimization techniques for propositional intuitionistic logic and their implementation
• A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations
• From Schütte’s Formal Systems to Modern Automated Deduction
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• Progress in the Development of Automated Theorem Proving for Higher-Order Logic
• leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
• Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
• Machine learning guidance for connection tableaux
• General clauses for SAT-based proof search in intuitionistic propositional logic
• Intuitionistic Decision Procedures Since Gentzen
• Title not available (Why is that?)
• Efficient SAT-based proof search in intuitionistic propositional logic
• Automating Theories in Intuitionistic Logic
• Practical Proof Search for Coq by Type Inhabitation
• The TPTP problem library. CNF release v1. 2. 1
• Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
• A tableaux calculus for default intuitionistic logic

Uses Software

• ILTP
• SATLIB
• TPTP
• STRIP
• ileanCoP
• JProver

This page was built for publication: The ILTP problem library for intuitionistic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877897)