903 search results - page 122 / 181 » Completeness Results for Memory Logics |
DEXAW
2008
IEEE
13 years 10 months ago
2008
IEEE
With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems. In ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
JSYML
2007
13 years 8 months ago
2007
We observe that the W∗ -hierarchy, a variant (introduced by Downey, Fellows, and Taylor [8]) of the better known W-hierarchy, coincides with the W-hierarchy, though not level wi...
DLOG
2011
13 years 14 days ago
2011
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
BMCBI
2006
13 years 9 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...