9 search results - page 2 / 2 » Deciding inseparability and conservative extensions in the d... |
TIME
2007
IEEE
13 years 11 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
JAPLL
2010
13 years 3 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
COORDINATION
2008
Springer
13 years 6 months ago
2008
Springer
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...