1544 search results - page 208 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
225
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
180
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
208
click to vote
CSREASAM
2009
15 years 7 months ago
2009
- Until recently the reasons for reduced efficiency and limited implementation of new security systems has been the insufficient performance of hardware that executes access contro...
139
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
We present Bristlecone, a programming language for robust software systems. Bristlecone applications have two components: a high-level organization description that specifies how t...
144
click to vote
DLOG
2003
15 years 7 months ago
2003
Description Logics (DLs), as a field of research, form a formal foundation of first-order semantic Web ontology languages, such as DAML+OIL and OWL. The Semantic Web will build ...