On the complexity of epistemic reasoning
Proceedings of the Fourth Annual Symposium on Logic in computer science
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
A sequent calculus and a theorem prover for standard conditional logics
ACM Transactions on Computational Logic (TOCL)
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Shallow Models for Non-iterative Modal Logics
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Generic Modal Cut Elimination Applied to Conditional Logics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a broadly applicable coalgebraic semantics and an ensuing general treatment of modal sequent and tableau calculi. Here, we present research into optimisation of the reasoning strategies employed in CoLoSS. Specifically, we discuss strategies of memoisation and dynamic programming that are based on the observation that short sequents play a central role in many of the logics under study. These optimisations seem to be particularly useful for the case of conditional logics, for some of which dynamic programming even improves the theoretical complexity of the algorithm. These strategies have been implemented in CoLoSS; we give a detailed comparison of the different heuristics, observing that in the targeted domain of conditional logics, a substantial speed-up can be achieved.