Sciweavers

342 search results - page 61 / 69
» Tableau Algorithms for Description Logics
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
16 years 15 days ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
107
Voted
ICFP
2003
ACM
16 years 10 days ago
Discriminative sum types locate the source of type errors
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
Matthias Neubauer, Peter Thiemann
118
Voted
SAC
2010
ACM
15 years 7 months ago
Inductive reasoning and semantic web search
Extensive research activities are recently directed towards the Semantic Web as a future form of the Web. Consequently, Web search as the key technology of the Web is evolving tow...
Claudia d'Amato, Floriana Esposito, Nicola Fanizzi...
105
Voted
LICS
2009
IEEE
15 years 7 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
110
Voted
PRDC
2006
IEEE
15 years 6 months ago
Detecting and Exploiting Symmetry in Discrete-state Markov Models
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
W. Douglas Obal II, Michael G. McQuinn, William H....