2214 search results - page 20 / 443 » Complexity of Reasoning |
AAAI
1996
14 years 10 months ago
1996
An important problem faced by auditors is gauging how much reliance can be placed on the accounting systems that process millions of transactions to produce the numbers summarized...
93
Voted
CADE
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
OWLED
2008
14 years 11 months ago
2008
Abstract. HermiT is a new OWL reasoner based on a novel "hypertableau" calculus. The new calculus addresses performance problems due to nondeterminism and model size--the...
84
Voted
TIME
2005
IEEE
15 years 3 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...