Efficient SAT-based proof search in intuitionistic propositional logic (Q2055856)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Efficient SAT-based proof search in intuitionistic propositional logic	scientific article

Statements

scholarly article

0 references

Efficient SAT-based proof search in intuitionistic propositional logic (English)

0 references

Camillo Fiorentini

0 references

publication date

1 December 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-79876-5_13

0 references

0 references

SAT Modulo Intuitionistic Implications

0 references

Contraction-free sequent calculi for intuitionistic logic

0 references

Theory and Applications of Satisfiability Testing

0 references

fCube: An Efficient Prover for Intuitionistic Propositional Logic

0 references

Simplification Rules for Intuitionistic Propositional Tableaux

0 references

Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models

0 references

Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic

0 references

A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic

0 references

A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description

0 references

Solving SAT and SAT Modulo Theories

0 references

The ILTP problem library for intuitionistic logic

0 references

0 references

Identifiers

10.1007/978-3-030-79876-5_13

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2055856

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2055856&oldid=36744549"