Results 1  10
of
317
Pushing the EL envelope
 In Proc. of IJCAI 2005
, 2005
"... Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already int ..."
Abstract

Cited by 461 (59 self)
 Add to MetaCart
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already
Local Reasoning about Programs that Alter Data Structures
, 2001
"... We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a lowlevel storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language is ba ..."
Abstract

Cited by 324 (28 self)
 Add to MetaCart
is based on a possible worlds model of the logic of bunched implications, and includes spatial conjunction and implication connectives alongside those of classical logic. Heap operations are axiomatized using what we call the "small axioms", each of which mentions only those cells accessed
Minimality with respect to Young’s axiom
 Houston Journal of Mathematics
, 1995
"... ABSTRACT. A topological space (X,•) satisfies Youngs ' axiom (or is T) if and only if given distinct elements x, y in X, {x) N {y) has cardinality at most one. Accordingly, given the lattice of all topologies definable for an infinite set X, those which are minimal with respect to T are ident ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABSTRACT. A topological space (X,•) satisfies Youngs ' axiom (or is T) if and only if given distinct elements x, y in X, {x) N {y) has cardinality at most one. Accordingly, given the lattice of all topologies definable for an infinite set X, those which are minimal with respect
Small coverings with smooth functions under the Covering Property Axiom
"... In the paper we formulate a Covering Property Axiom CPAprism, which holds in the iterated perfect set model, and show that it implies the following facts of which (a) and (b) are the generalizations of results of Steprāns [26]. (a) There exists a family F of less then continuum many C1 functions fr ..."
Abstract
 Add to MetaCart
In the paper we formulate a Covering Property Axiom CPAprism, which holds in the iterated perfect set model, and show that it implies the following facts of which (a) and (b) are the generalizations of results of Steprāns [26]. (a) There exists a family F of less then continuum many C1 functions
Using Secure Coprocessors
, 1994
"... The views and conclusions in this document are those of the authors and do not necessarily represent the official policies or endorsements of any of the research sponsors. How do we build distributed systems that are secure? Cryptographic techniques can be used to secure the communications between p ..."
Abstract

Cited by 165 (8 self)
 Add to MetaCart
assumption upon which secure distributed systems are built; without this foundation even the best cryptosystem or the most secure kernel will crumble. In this thesis, I address the distributed security problem by proposing the addition of a small, physically secure hardware module, a secure coprocessor
A classification of natural rivers.
 Catena
, 1994
"... Abstract A classification system for natural rivers is presented in which a morphological arrangement of stream characteristics is organized into relatively homogeneous stream types. This paper describes morphologically similar stream reaches that are divided into 7 major stream type categories tha ..."
Abstract

Cited by 173 (1 self)
 Add to MetaCart
classification interrelationships were derived from 450 rivers throughout the U.S, Canada, and New Zealand. Data used in the development of this classification involved a great diversity of hydrophysiographic/geomorphic provinces from small to large rivers and in catchments from headwater streams
Reasoning as Axioms Change Incremental View Maintenance Reconsidered
"... Abstract. We present a novel incremental algorithm to compute changes to materialized views in logic databases like those used by rulebased reasoners. Such reasoners have to address the problem of changing axioms in the presence of materializations of derived atoms. Existing approaches have drawbac ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We present a novel incremental algorithm to compute changes to materialized views in logic databases like those used by rulebased reasoners. Such reasoners have to address the problem of changing axioms in the presence of materializations of derived atoms. Existing approaches have
Open Access AXIOME: automated exploration of microbial diversity
"... Background: Although highthroughput sequencing of small subunit rRNA genes has revolutionized our understanding of microbial ecosystems, these technologies generate data at depths that benefit from automated analysis. Here we present AXIOME (Automation, eXtension, and Integration Of Microbial Ecolo ..."
Abstract
 Add to MetaCart
Background: Although highthroughput sequencing of small subunit rRNA genes has revolutionized our understanding of microbial ecosystems, these technologies generate data at depths that benefit from automated analysis. Here we present AXIOME (Automation, eXtension, and Integration Of Microbial
Sampling Variability and Axioms of Classical Test Theory
, 2011
"... Many wellknown equations in classical test theory are mathematical identities in populations of individuals but not in randomsamples from those populations.First, test scores are subject to the same sampling error that is familiar in statistical estimation and hypothesis testing. Second, the assump ..."
Abstract
 Add to MetaCart
, the assumptions made in derivation of formulas in test theory are not necessarily satisfied in small samples. The present studyderivedmodified equations relating test scores andcomponents of scores that are identities in samples of any size and that reduce to the more familiar equations when various correlations
Debugging Snomed ct Using Axiom Pinpointing in the Description Logic EL+
, 2008
"... Snomed ct is a largescale medical ontology, which is developed using a variant of the inexpressive Description Logic EL. Description Logic reasoning can not only be used to compute subsumption relationships between Snomed concepts, but also to pinpoint the reason why a certain subsumption relations ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
describe a new method for axiom pinpointing in the Description Logic EL +,whichis based on the computation of socalled reachabilitybased modules. Our experiments on Snomed ct show that the sets of axioms explaining subsumption are usually quite small, and that our method is fast enough to compute
Results 1  10
of
317