Systematic Verification of the Modal Logic Cube in Isabelle/HOL
We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the modal logic cube, and using encodings in...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2015-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1507.08717v1 |
id |
doaj-10ad337b64f4493583ff59a1c3a42f27 |
---|---|
record_format |
Article |
spelling |
doaj-10ad337b64f4493583ff59a1c3a42f272020-11-24T23:42:35ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802015-07-01186Proc. PxTP 2015274110.4204/EPTCS.186.5:3Systematic Verification of the Modal Logic Cube in Isabelle/HOLChristoph Benzmüller0Maximilian Claus1Nik Sultana2 Freie Universität Berlin, Germany Freie Universität Berlin, Germany Cambridge University, UK We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the modal logic cube, and using encodings in first-order logic in combination with first-order automated theorem provers. In contrast, our solution is more elegant, transparent and effective. It employs an embedding of quantified modal logic in classical higher-order logic. Automated reasoning tools, such as Sledgehammer with LEO-II, Satallax and CVC4, Metis and Nitpick, are employed to achieve full automation. Though successful, the experiments also motivate some technical improvements in the Isabelle/HOL tool.http://arxiv.org/pdf/1507.08717v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Christoph Benzmüller Maximilian Claus Nik Sultana |
spellingShingle |
Christoph Benzmüller Maximilian Claus Nik Sultana Systematic Verification of the Modal Logic Cube in Isabelle/HOL Electronic Proceedings in Theoretical Computer Science |
author_facet |
Christoph Benzmüller Maximilian Claus Nik Sultana |
author_sort |
Christoph Benzmüller |
title |
Systematic Verification of the Modal Logic Cube in Isabelle/HOL |
title_short |
Systematic Verification of the Modal Logic Cube in Isabelle/HOL |
title_full |
Systematic Verification of the Modal Logic Cube in Isabelle/HOL |
title_fullStr |
Systematic Verification of the Modal Logic Cube in Isabelle/HOL |
title_full_unstemmed |
Systematic Verification of the Modal Logic Cube in Isabelle/HOL |
title_sort |
systematic verification of the modal logic cube in isabelle/hol |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2015-07-01 |
description |
We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the modal logic cube, and using encodings in first-order logic in combination with first-order automated theorem provers. In contrast, our solution is more elegant, transparent and effective. It employs an embedding of quantified modal logic in classical higher-order logic. Automated reasoning tools, such as Sledgehammer with LEO-II, Satallax and CVC4, Metis and Nitpick, are employed to achieve full automation. Though successful, the experiments also motivate some technical improvements in the Isabelle/HOL tool. |
url |
http://arxiv.org/pdf/1507.08717v1 |
work_keys_str_mv |
AT christophbenzmuller systematicverificationofthemodallogiccubeinisabellehol AT maximilianclaus systematicverificationofthemodallogiccubeinisabellehol AT niksultana systematicverificationofthemodallogiccubeinisabellehol |
_version_ |
1725503880175812608 |