The inverse method is a saturation based theorem proving technique; it relies on a forward proof-search strategy and can be applied to cut-free calculi enjoying the subformula property. Here we apply this method to derive the unprovability of a formula in the modal logic K. To this aim, we design a forward calculus to check the K-satisfiability of a set of modal formulas. From a derivation of Ξ, we can extract a Kripke model of Ξ.
Ferrari, M., Fiorentini, C., & Fiorino., G. (2018). Forward countermodel construction in modal Logic K. In Proceedings of the 33rd Italian Conference on Computational Logic, Bolzano, Italy, September 20-22, 2018 (pp.75-81). CEUR-WS.
Citazione: | Ferrari, M., Fiorentini, C., & Fiorino., G. (2018). Forward countermodel construction in modal Logic K. In Proceedings of the 33rd Italian Conference on Computational Logic, Bolzano, Italy, September 20-22, 2018 (pp.75-81). CEUR-WS. | |
Tipo: | paper | |
Carattere della pubblicazione: | Scientifica | |
Presenza di un coautore afferente ad Istituzioni straniere: | No | |
Titolo: | Forward countermodel construction in modal Logic K | |
Autori: | Ferrari, M; Fiorentini, C; Fiorino., G | |
Autori: | ||
Data di pubblicazione: | 2018 | |
Lingua: | English | |
Nome del convegno: | 33rd Italian Conference on Computational Logic, CILC 2018 | |
Serie: | CEUR WORKSHOP PROCEEDINGS | |
Appare nelle tipologie: | 02 - Intervento a convegno |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
paper8.pdf | Publisher's version | Administrator Richiedi una copia |