@inproceedings{72c756944aa446d9ad2f7a271b2005e6,
title = "SAT-Based decision procedure for analytic pure sequent calculi",
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.",
author = "Ori Lahav and Yoni Zohar",
note = "Funding Information: This research was supported by The Israel Science Foundation (grant no. 280-10).; 7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 ; Conference date: 19-07-2014 Through 22-07-2014",
year = "2014",
doi = "10.1007/978-3-319-08587-6\_6",
language = "الإنجليزيّة",
isbn = "9783319085869",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "76--90",
booktitle = "Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings",
address = "ألمانيا",
}