129 search results - page 7 / 26 » Benchmarking Reasoners for Multi-Ontology Applications |
POPL
2009
ACM
14 years 11 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
ASWC
2008
Springer
14 years 10 days ago
2008
Springer
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
DAC
2005
ACM
14 years 11 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
CADE
2009
Springer
14 years 11 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
AAMAS
2004
Springer
13 years 10 months ago
2004
Springer
The Procedural Reasoning System (PRS) is the best established agent architecture currently available. It has been deployed in many major industrial applications, ranging from fault...