SAT Modulo Intuitionistic Implications

DOI10.1007/978-3-662-48899-7_43zbMath1435.68363OpenAlexW2295924173MaRDI QIDQ3460091

Dan Rosen, Koen Claessen

Publication date: 12 January 2016

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48899-7_43

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (7)

CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT ⋮ Goal-oriented proof-search in natural deduction for intuitionistic propositional logic ⋮ Para-Disagreement Logics and Their Implementation Through Embedding in Coq and SMT ⋮ Efficient SAT-based proof search in intuitionistic propositional logic ⋮ A tableaux calculus for default intuitionistic logic ⋮ intuit ⋮ SAT-based proof search in intermediate propositional logics

This page was built for publication: SAT Modulo Intuitionistic Implications