Logic for Programming, Artificial Intelligence, and Reasoning

Logic for Programming, Artificial Intelligence, and Reasoning pp 558-574

Proof Search in Nested Sequent Calculi

Conference paper

DOI: 10.1007/978-3-662-48899-7_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9450)
Cite this paper as:
Lellmann B., Pimentel E. (2015) Proof Search in Nested Sequent Calculi. In: Davis M., Fehnker A., McIver A., Voronkov A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, vol 9450. Springer, Berlin, Heidelberg

Abstract

We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequent calculi. The resulting systems are amenable to specifications in linear logic. Examples include modal logic \(\mathsf {K}\), a simply dependent bimodal logic and the standard non-normal modal logics. As byproduct we obtain the first nested sequent calculi for the considered non-normal modal logics.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Institute of Computer LanguagesTU WienViennaAustria
  2. 2.Departamento de MatemáticaUFRNNatalBrazil

Personalised recommendations