Implementing Connection Calculi for First-order Modal Logics

15 pages•Published: November 25, 2013

Abstract

An implementation of an automated theorem prover for first-order modal logic is presented that works for the constant, cumulative and varying domains of the modal logics D, T, S4 and S5. It is based on the (classical) connection calculus and uses prefixes (or world paths) and a prefix unification algorithm to capture the restrictions given by the Kripke semantics of the standard modal logics. This permits a modular and elegant treatment of the considered modal logics and yields an efficient implementation. Details of the calculus, the implementation and performance results on the QMLTP problem library are presented.

Keyphrases: connection calculus, first order modal logic, implementation

In: Konstantin Korovin, Stephan Schulz and Eugenia Ternovska (editors). IWIL 2012. The 9th International Workshop on the Implementation of Logics, vol 22, pages 18-32.

Links:	https://easychair.org/publications/paper/xZj4
	https://doi.org/10.29007/82m9

BibTeX entry

@inproceedings{IWIL2012:Implementing_Connection_Calculi_First,
  author    = {Jens Otten},
  title     = {Implementing Connection Calculi for First-order Modal Logics},
  booktitle = {IWIL 2012. The 9th International Workshop on the Implementation of Logics},
  editor    = {Konstantin Korovin and Stephan Schulz and Eugenia Ternovska},
  series    = {EPiC Series in Computing},
  volume    = {22},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/xZj4},
  doi       = {10.29007/82m9},
  pages     = {18-32},
  year      = {2013}}

Download PDF Open PDF in browser