1544 search results - page 132 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
181
click to vote
CADE
2004
Springer
15 years 12 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
140
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
174
click to vote
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
The semantic web vision will facilitate automation of many tasks, including the location and dynamic reconfiguration of web services. In this article, we are concerned with a speci...
188
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
175
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...