616 search results - page 36 / 124 » Bounded Model Checking with Description Logic Reasoning |
FTP
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
RR
2009
Springer
14 years 3 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
DLOG
2000
13 years 10 months ago
2000
In this paper, we demonstrate that the main standard optimization techniques dependency directed backtracking and model merging can be adapted to description logics with concrete ...
SEMWEB
2009
Springer
14 years 1 months ago
2009
Springer
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
ICALP
2000
Springer
14 years 14 days ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...