2381 search results - page 53 / 477 » On Ordering Descriptions in a Description Logic |
DLOG
2009
14 years 9 months ago
2009
Abstract. Generalized closed world reasoning allows for the assumption of a specified maximal set of negated atomic assertions retaining the consistency of an indefinite knowledge ...
SEFM
2005
IEEE
15 years 5 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
113
click to vote
TABLEAUX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
108
click to vote
DLOG
1996
15 years 1 months ago
1996
Number restrictions are concept constructors that are available in almost all implemented description logic systems. However, even though there has lately been considerable effort...
ICFCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...