SAT-Based Decision Procedure for Analytic Pure Sequent Calculi

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

Yoni Zohar, Ori Lahav

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

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 (10)

• Proof theory for functional modal logic
• Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
• On the use of autarkies for satisfiability decision
• Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi
• Taming Paraconsistent (and Other) Logics
• Sequent systems for negative modalities
• 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
• Tools for the Investigation of Substructural and Paraconsistent Logics

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)