Results 1 - 10
of
1,099
Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract
-
Cited by 497 (123 self)
- Add to MetaCart
, but also answering complex queries (in particular, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. We show that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in the size
GSAT and Dynamic Backtracking
- Journal of Artificial Intelligence Research
, 1994
"... There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new te ..."
Abstract
-
Cited by 386 (15 self)
- Add to MetaCart
There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new
A generalized temporal role-based access control model
, 2001
"... Role-based access control (RBAC) models are receiving increasing attention as a generalized approach to access control. Roles may be available to users at certain time periods, and unavailable at others. Moreover, there can be temporal dependencies among roles. To tackle such dynamic aspects, we int ..."
Abstract
-
Cited by 304 (22 self)
- Add to MetaCart
executed, or deferred by an explicitly specified amount of time. Enabling and disabling actions may be given a priority, which is used to solve conflicting actions. A formal semantics for the specification language is provided, and a polynomial safeness check is introduced to reject ambiguous
Fault-tolerant quantum computation
- In Proc. 37th FOCS
, 1996
"... It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information i ..."
Abstract
-
Cited by 264 (5 self)
- Add to MetaCart
as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1 / log c t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1 /t). We do this by showing that operations can be performed
Selection of Views to Materialize in a Data Warehouse
, 1997
"... . A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decisionsupport or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The ..."
Abstract
-
Cited by 246 (5 self)
- Add to MetaCart
. The goal is to select an appropriate set of views that minimizes total query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space etc. In this article, we develop a theoretical framework for the general problem
Just the right amount: Extracting modules from ontologies
- IN: PROC. OF WWW2007
, 2007
"... The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a given set of terms, i.e., to include all axioms relevant to the meaning of these terms, and study the problem of extract ..."
Abstract
-
Cited by 103 (15 self)
- Add to MetaCart
provide the above guarantee, but that are possibly too strict, and that may thus result in larger modules: the first approximation is semantic and can be computed using existing DL reasoners; the second is syntactic, and can be computed in polynomial time. Finally, we report on an empirical evaluation
On coding for reliable communication over packet networks
, 2008
"... We consider the use of random linear network coding in lossy packet networks. In particular, we consider the following simple strategy: nodes store the packets that they receive and, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of ..."
Abstract
-
Cited by 217 (37 self)
- Add to MetaCart
of stored packets. In such a strategy, intermediate nodes perform additional coding yet do not decode nor wait for a block of packets before sending out coded packets. Moreover, all coding and decoding operations have polynomial complexity. We show that, provided packet headers can be used to carry
Negative dependence and the geometry of polynomials
, 2008
"... We introduce the class of strongly Rayleigh probability measures by means of geometric properties of their generating polynomials that amount to the stability of the latter. This class covers important models such as determinantal measures (e.g. product measures, uniform random spanning tree measur ..."
Abstract
-
Cited by 47 (13 self)
- Add to MetaCart
We introduce the class of strongly Rayleigh probability measures by means of geometric properties of their generating polynomials that amount to the stability of the latter. This class covers important models such as determinantal measures (e.g. product measures, uniform random spanning tree
Microlocal analysis and interacting quantum field theory: Renormalizability on Physical Backgrounds
, 1999
"... We present a perturbative construction of interacting quantum field theories on smooth globally hyperbolic (curved) space-times. We develop a purely local version of the Stückelberg-Bogoliubov-Epstein-Glaser method of renormalization by using techniques from microlocal analysis. Relying on recent r ..."
Abstract
-
Cited by 160 (22 self)
- Add to MetaCart
results of Radzikowski, Köhler and the authors about a formulation of a local spectrum condition in terms of wave front sets of correlation functions of quantum fields on curved space-times, we construct time-ordered operatorvalued products of Wick polynomials of free fields. They serve as building blocks
Polynomial approximations for bivariate aggregate claims amount probability distributions
"... To cite this version: ..."
Results 1 - 10
of
1,099