We present a decision procedure for intermediate logics relying on a modular extension of the SAT-based prover intuitR for IPL (Intuitionistic Propositional Logic). Given an intermediate logic L and a formula α, the procedure outputs either a Kripke countermodel for α or the instances of the characteristic axioms of L that must be added to IPL in order to prove α. The procedure exploits an incremental SAT-solver; during the computation, new clauses are learned and added to the solver.

SAT-based proof search in intermediate propositional logics

Ferrari M.
2022-01-01

Abstract

We present a decision procedure for intermediate logics relying on a modular extension of the SAT-based prover intuitR for IPL (Intuitionistic Propositional Logic). Given an intermediate logic L and a formula α, the procedure outputs either a Kripke countermodel for α or the instances of the characteristic axioms of L that must be added to IPL in order to prove α. The procedure exploits an incremental SAT-solver; during the computation, new clauses are learned and added to the solver.
2022
Automated Reasoning : 11th International Joint Conference, IJCAR 2022
978-3-031-10768-9
978-3-031-10769-6
11th International Joint Conference on Automated Reasoning, IJCAR 2022, part of the Federated Logic Conference, FLoC 2022
Haifa, Israel
August 8-10, 2022
File in questo prodotto:
File Dimensione Formato  
2022-fiofer-SAT-BasedProofSearchInIntermediatePropositionalLogics-ijcar.pdf

accesso aperto

Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 796.16 kB
Formato Adobe PDF
796.16 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11383/2143592
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 1
social impact