SAT-Based Decision Procedure for Analytic Pure Sequent Calculi

  • Ori Lahav
  • Yoni Zohar
Conference paper

DOI: 10.1007/978-3-319-08587-6_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)
Cite this paper as:
Lahav O., Zohar Y. (2014) SAT-Based Decision Procedure for Analytic Pure Sequent Calculi. In: Demri S., Kapur D., Weidenbach C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science, vol 8562. Springer, Cham

Abstract

We identify a wide family of analytic sequent calculi for propositional non-classical logics whose derivability problem can be uniformly reduced to SAT. The proposed reduction is based on interpreting these calculi using non-deterministic semantics. Its time complexity is polynomial, and, in fact, linear for a useful subfamily. We further study an extension of such calculi with Next operators, and show that this extension preserves analyticity and is subject to a similar reduction to SAT. A particular interesting instance of these results is a HORNSAT-based linear-time decision procedure for Gurevich and Neeman’s primal infon logic and several natural extensions of it.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Ori Lahav
    • 1
  • Yoni Zohar
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityIsrael

Personalised recommendations