We present tuCLEVER, a theorem prover for the strongest conditional logics of counterfactual reasoning introduced by Lewis in the seventies. tuCLEVER implements some hypersequent calculi recently introduced for the system VTU and its main extensions. tuCLEVER is inspired by the methodology of leanTAP and it is implemented in Prolog. Preliminary experimental results show that the performances of tuCLEVER are promising.

Theorem proving for lewis logics of counterfactual reasoning?

Pozzato G. L.
2020-01-01

Abstract

We present tuCLEVER, a theorem prover for the strongest conditional logics of counterfactual reasoning introduced by Lewis in the seventies. tuCLEVER implements some hypersequent calculi recently introduced for the system VTU and its main extensions. tuCLEVER is inspired by the methodology of leanTAP and it is implemented in Prolog. Preliminary experimental results show that the performances of tuCLEVER are promising.
2020
35th Italian Conference on Computational Logic, CILC 2020
Rende (virtual)
2020
CEUR Workshop Proceedings
CEUR-WS
2710
199
213
http://ceur-ws.org/Vol-2710/paper13.pdf
Girlando M.; Lellmann B.; Olivetti N.; Pesce S.; Pozzato G.L.
File in questo prodotto:
File Dimensione Formato  
paper13.pdf

Accesso aperto

Tipo di file: PDF EDITORIALE
Dimensione 1.96 MB
Formato Adobe PDF
1.96 MB 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/2318/1795668
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact