441 search results - page 85 / 89 » Automated Benchmarking of Description Logic Reasoners |
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
WWW
2003
ACM
14 years 9 months ago
2003
ACM
An important objective of the Semantic Web is to make Electronic Commerce interactions more flexible and automated. To achieve this, standardization of ontologies, message content...
JAIR
2010
13 years 6 months ago
2010
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
In this paper we propose a new communication synthesis approach targeting systems with sequential communication media (SCM). Since SCMs require that the reading sequence and writi...
KBSE
2005
IEEE
14 years 2 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...