SAT-based proof search in intermediate propositional logics
From MaRDI portal
Publication:2104497
DOI10.1007/978-3-031-10769-6_5OpenAlexW4289103993MaRDI QIDQ2104497FDOQ2104497
Authors: Camillo Fiorentini, Mauro Ferrari 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_5
Recommendations
- Efficient SAT-based proof search in intuitionistic propositional logic
- Proof-search in intuitionistic logic based on constraint satisfaction
- A proof-search procedure for intuitionistic propositional logic
- scientific article; zbMATH DE number 1753197
- scientific article; zbMATH DE number 1390270
- Proof-search in hybrid logic
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
- scientific article; zbMATH DE number 1348467
- scientific article; zbMATH DE number 1696770
- Induction in saturation-based proof search
Cites Work
- fCube: an efficient prover for intuitionistic propositional logic
- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description
- SAT Modulo Intuitionistic Implications
- Title not available (Why is that?)
- Strongly equivalent logic programs
- Title not available (Why is that?)
- Solving SAT and SAT Modulo Theories
- Automated synthesis of tableau calculi
- Contraction-free sequent calculi for intuitionistic logic
- Gödel-Dummett counter-models through matrix computation
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- Efficient SAT-based proof search in intuitionistic propositional logic
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT
- Terminating calculi for propositional Dummett logic with subformula property
- Generalized tableau systems for intermediate propositional logics
Cited In (5)
- Satallax: An Automatic Higher-Order Prover
- General clauses for SAT-based proof search in intuitionistic propositional logic
- Title not available (Why is that?)
- Efficient SAT-based proof search in intuitionistic propositional logic
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
Uses Software
This page was built for publication: SAT-based proof search in intermediate propositional logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104497)
