12 search results - page 1 / 3 » Optimal Tableau Algorithms for Coalgebraic Logics |
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
CADE
2010
Springer
13 years 5 months ago
2010
Springer
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
ENTCS
2010
13 years 4 months ago
2010
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 bro...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...