Sentence (1) strongly suggests that the speaker does not have a sister: (1) John believes that I have a sister. a. Alternative: John knows that I have a sister. b. Actual inference: the speaker does not have a sister. 5 c. Predicted inference: it is not common belief that the speaker has a sister. According to Heim (1991), Percus (2006), and Sauerland (2006), this inference should follow from t...

introduction: breastfeeding is an important principle in pediatric health. it decreases their mortality and protect them fromm diseases in the first 6-month of life. this study aimed to determined maternal knowledge and practice in mashhad city about breast-feeding in first 6 -month of infant's life.   materials and methods: this analytic study was conducted on 105 mothers who had a child ...

Introduction Conclusions References

We consider NCA labeling schemes: given a rooted tree T , label the nodes of T with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the label of their nearest common ancestor. For trees with n nodes we present upper and lower bounds establishing that labels of size (2± ǫ) log n, ǫ < 1 are both sufficient and necessary. Alstrup, Bill...

In this lecture, we look at various data structures to solve problems about static trees: given a static tree, we perform some preprocessing to construct our data structure, then use the data structure to answer queries about the tree. The three problems we look at in this lecture are range minimum queries (RMQ), lowest common ancestors (LCA), and level ancestor (LA); we will support all these ...

Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general EL-TBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL-TBoxes. We show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs, which in turn yields a c...

Finding the lowest common ancestor of a given pair of nodes is a fundamental algorithmic problem. In this paper we study the lowest common ancestor(LCA) problem on directed acyclic graphs (DAGs). A lowest common ancestor of two nodes a and b is a node c which is a common ancestor of a and b and no other node is both a common ancestor of a and b and a proper descendant of c. LCA on trees have be...

The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.

Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and the CM-5. Some LCAN properties are stated and the permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an ite...