616 search results - page 3 / 124 » Bounded Model Checking with Description Logic Reasoning |
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
DLOG
2003
13 years 6 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
CSL
2006
Springer
13 years 5 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
DLOG
2009
13 years 3 months ago
2009
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...