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

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

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

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

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

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 hydro-physiographic/geomorphic provinces from small to large rivers and in catchments from headwater streams

Abstract. We present a novel incremental algorithm to compute changes to materialized views in logic databases like those used by rule-based reasoners. Such reasoners have to address the problem of changing axioms in the presence of materializations of derived atoms. Existing approaches have

Background: Although high-throughput 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

, 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

describe a new method for axiom pinpointing in the Description Logic EL +,whichis based on the computation of so-called 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