Optimal tableau algorithms for coalgebraic logics

DOI10.1007/978-3-642-12002-2_9zbMATH Open1284.03207OpenAlexW1575920076MaRDI QIDQ3557073FDOQ3557073

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Reasoning with global assumptions in arithmetic modal logics
• CoLoSS: the coalgebraic logic satisfiability solver
• Computer Science Logic
• Accelerating tableaux proofs using compact representations
• Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• Global caching for the alternation-free \(\mu\)-calculus
• 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)