3047 search results - page 331 / 610 » On the Meaning of Logical Completeness |
240
click to vote
FLAIRS
2009
15 years 5 months ago
2009
Ensuring the consistency and completeness of Semantic Web ontologies is practically impossible, because of their scale and highly dynamic nature. Many web applications, therefore,...
234
click to vote
DLOG
2011
14 years 11 months ago
2011
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
318
Voted
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
217
Voted
WISE
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
205
Voted
RTA
2005
Springer
16 years 28 days ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...