Automating Quantified Multimodal Logics in Simple Type Theory -- A Case Study

05/27/2009
by   Christoph Benzmueller, et al.
0

In a case study we investigate whether off the shelf higher-order theorem provers and model generators can be employed to automate reasoning in and about quantified multimodal logics. In our experiments we exploit the new TPTP infrastructure for classical higher-order logic.

READ FULL TEXT
research
05/14/2009

Quantified Multimodal Logics in Simple Type Theory

We present a straightforward embedding of quantified multimodal logic in...
research
04/30/2010

Simple Type Theory as Framework for Combining Logics

Simple type theory is suited as framework for combining classical and no...
research
07/26/2019

Extensional Higher-Order Paramodulation in Leo-III

Leo-III is an automated theorem prover for extensional type theory with ...
research
07/25/2002

A Paraconsistent Higher Order Logic

Classical logic predicts that everything (thus nothing useful at all) fo...
research
12/21/2019

First-order swap structures semantics for some Logics of Formal Inconsistency

The logics of formal inconsistency (LFIs, for short) are paraconsistent ...
research
09/10/2018

Elementary Multimodal Logics

We study multimodal logics over universally first-order definable classe...
research
07/05/2020

A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs

The paper gives a comprehensive presentation of a framework, embedded in...

Please sign up or login with your details

Forgot password? Click here to reset