Sciweavers

1699 search results - page 89 / 340
» On the Expressive Power of QLTL
Sort
View
150
Voted
AAAI
2010
15 years 2 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 1 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
PVLDB
2010
151views more  PVLDB 2010»
14 years 11 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
153
Voted
BMCBI
2011
14 years 7 months ago
Using Stochastic Causal Trees to Augment Bayesian Networks for Modeling eQTL Datasets
Background: The combination of genotypic and genome-wide expression data arising from segregating populations offers an unprecedented opportunity to model and dissect complex phen...
Kyle C. Chipman, Ambuj K. Singh
129
Voted
LICS
2010
IEEE
14 years 11 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...