Optimal tableau algorithms for coalgebraic logics

DOI10.1007/978-3-642-12002-2_9MaRDI QIDQ3557073zbMATH OpenOpenAlexFDO

Authors Rajeev Goré, Clemens Kupke, Dirk Pattinson

Publication date 27 April 2010

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12002-2_9

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Categorical logic, topoi (03G30)

Recommendations

• Global caching for coalgebraic description logics
• Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
• ExpTime tableaux with global caching for graded propositional dynamic logic
• Reasoning with global assumptions in arithmetic modal logics

Cited in

(8)

• Accelerating tableaux proofs using compact representations
• Reasoning with global assumptions in arithmetic modal logics
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
• Global caching for the alternation-free -calculus
• CoLoSS: the coalgebraic logic satisfiability solver
• Computer Science Logic
• Global caching for coalgebraic description logics

This page was built for publication: Optimal tableau algorithms for coalgebraic logics

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