SAT-based decision procedure for analytic pure sequent calculi

DOI10.1007/978-3-319-08587-6_6zbMATH Open1433.03025OpenAlexW203477399MaRDI QIDQ3192182FDOQ3192182

Authors: Ori Lahav, Yoni Zohar 

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_6

Recommendations

• Pure sequent calculi. Analyticity and decision procedure
• SAT-based decision procedures for classical modal logics
• SAT-based decision procedures for classical modal logics
• On the construction of analytic sequent calculi for sub-classical logics
• scientific article; zbMATH DE number 1538057

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Cited In (11)

• Proof theory for functional modal logic
• Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
• Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
• Taming paraconsistent (and other) logics: an algorithmic approach
• On the use of autarkies for satisfiability decision
• Sequent systems for negative modalities
• Tools for the investigation of substructural and paraconsistent logics
• Pure sequent calculi. Analyticity and decision procedure
• SAT-based decision procedures for classical modal logics
• A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA)
• Efficient reasoning with inconsistent information using C-systems

This page was built for publication: SAT-based decision procedure for analytic pure sequent calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192182)