1544 search results - page 203 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
185
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
144
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
172
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
—Towards a data-centric workflow approach, we introduce an artifact model to capture data and workflow management activities in distributed settings. The model is built on Acti...
176
click to vote
TIME
2005
IEEE
15 years 12 months ago
2005
IEEE
The language of timed µCRL is an extension of an ACP-style process algebra-based language µCRL with time-related features. In this paper we describe this language and its equati...
182
click to vote
WSPI
2004
15 years 7 months ago
2004
Abstract. We examine the possibility of applying knowledge representation and automated reasoning in the context of philosophical ontology. For this purpose, we use the axioms and ...