616 search results - page 15 / 124 » Bounded Model Checking with Description Logic Reasoning |
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Bipolarity is an important feature of spatial information, involved in the expression of preferences and constraints about spatial positioning or in pairs of opposite spatial relat...
FMSD
2006
13 years 9 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
CONCUR
1997
Springer
14 years 1 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
ESWS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The demonstration presents Pronto - a prototype of a nonmonotonic probabilistic reasoner for very expressive Description Logics. Pronto is built on top of the OWL DL reas...