Sciweavers

1717 search results - page 296 / 344
» A Computable Spectral Theorem
Sort
View
106
Voted
KR
2010
Springer
15 years 5 months ago
Decomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...
PLDI
2009
ACM
15 years 5 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
107
Voted
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
15 years 5 months ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...
CSL
2001
Springer
15 years 5 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
TYPES
1998
Springer
15 years 4 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner