SAT-Based decision procedure for analytic pure sequent calculi

Ori Lahav; Yoni Zohar

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

SAT-Based decision procedure for analytic pure sequent calculi

Ori Lahav
, Yoni Zohar

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

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.

Original language	English
Title of host publication	Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings
Publisher	Springer Verlag
Pages	76-90
Number of pages	15
ISBN (Print)	9783319085869
DOIs	https://doi.org/10.1007/978-3-319-08587-6_6
State	Published - 2014
Externally published	Yes
Event	7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 - Vienna, Austria Duration: 19 Jul 2014 → 22 Jul 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8562 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014
Country/Territory	Austria
City	Vienna
Period	19/07/14 → 22/07/14

Bibliographical note

Funding Information:
This research was supported by The Israel Science Foundation (grant no. 280-10).

Funding

This research was supported by The Israel Science Foundation (grant no. 280-10).

Funders	Funder number
Israel Science Foundation	280-10

Access to Document

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

Cite this

Lahav, O., & Zohar, Y. (2014). SAT-Based decision procedure for analytic pure sequent calculi. In Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings (pp. 76-90). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8562 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-319-08587-6_6

Lahav, Ori ; Zohar, Yoni. / SAT-Based decision procedure for analytic pure sequent calculi. Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, 2014. pp. 76-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{357dda662baf494ba0659f1eaa4f21bc,

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 = "גרמניה",

}

Lahav, O & Zohar, Y 2014, SAT-Based decision procedure for analytic pure sequent calculi. in Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8562 LNAI, Springer Verlag, pp. 76-90, 7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, 19/07/14. https://doi.org/10.1007/978-3-319-08587-6_6

SAT-Based decision procedure for analytic pure sequent calculi. / Lahav, Ori; Zohar, Yoni.
Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, 2014. p. 76-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8562 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - SAT-Based decision procedure for analytic pure sequent calculi

AU - Lahav, Ori

AU - Zohar, Yoni

N1 - Funding Information: This research was supported by The Israel Science Foundation (grant no. 280-10).

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84958545892

U2 - 10.1007/978-3-319-08587-6_6

DO - 10.1007/978-3-319-08587-6_6

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958545892

SN - 9783319085869

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 90

BT - Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings

PB - Springer Verlag

T2 - 7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014

Y2 - 19 July 2014 through 22 July 2014

ER -

Lahav O, Zohar Y. SAT-Based decision procedure for analytic pure sequent calculi. In Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag. 2014. p. 76-90. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-08587-6_6

SAT-Based decision procedure for analytic pure sequent calculi

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this