Sciweavers

16666 search results - page 356 / 3334
» Descriptive and Computational Complexity
Sort
View
DLOG
2004
15 years 8 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
ENTCS
2006
155views more  ENTCS 2006»
15 years 6 months ago
Mathematical Service Trading Based on Equational Matching
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...
Aurélie Hurault, Marc Pantel
TASE
2010
IEEE
15 years 1 months ago
Clear and Precise Specification of Ecological Data Management Processes and Dataset Provenance
Abstract--With the availability of powerful computational and communication systems, scientists now readily access large, complicated derived datasets and build on those results to...
Leon J. Osterweil, Lori A. Clarke, Aaron M. Elliso...
CIE
2006
Springer
15 years 10 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 7 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz