4 search results - page 1 / 1 » Global Caching for Coalgebraic Description Logics |
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...
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...
DLOG
2007
13 years 6 months ago
2007
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
AI
2000
Springer
13 years 4 months ago
2000
Springer
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....