5214 search results - page 989 / 1043 » The Online Specialization Problem |
CADE
2006
Springer
14 years 9 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
CADE
2001
Springer
14 years 9 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
VLDB
2006
ACM
14 years 9 months ago
2006
ACM
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...