The proliferation of contextualized knowledge in the Semantic Web (SW) has led to the popularity of knowledge formats such as quads in the SW community. A quad is an extension of an RDF triple with contextual information of the triple. In this paper, we study the problem of query answering over quads augmented with forall-existential bridge rules that enable interoperability of reasoning betwee...

We propose an ownership types system with existential quantification of owners, similar to the existential quantification of types in models of Java wildcards. This produces a system with variant ownership types. Using explicit existential types for variance is more expressive, less ad hoc, and easier to understand and reason about than previous solutions. Furthermore, we propose using both typ...

We investigate a SAT-based bounded model checking (BMC) method for EMTLK (the existential fragment of the metric temporal logic with knowledge) that is interpreted over timed models generated by timed interpreted systems. In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a linear temporal logic (called HLTLK), and we provi...

In this study a phenomenological approach was used in order to enter deeply into the experience of living with violence during pregnancy. The aim of the study was to gain a deeper understanding of women's experiences of being exposed to intimate partner violence (IPV) during pregnancy. The data were collected through in-depth interviews with five Norwegian women; two during pregnancy and three ...

BACKGROUND Nursing home and home care nursing staff must increasingly deal with palliative care challenges, due to cost cutting in specialized health care. Research indicates that a significant number of dying patients long for adequate spiritual and existential care. Several studies show that this is often a source of anxiety for care workers. Teaching care workers to alleviate dying patients'...

Data Types have Existential Types data Stack a = forall s. Stack s -self (a->s->s) -push (s->s) -pop (s->a) -top (s->Bool) -empty push :: a -> Stack a -> Stack a push x (Stack s push’ pop top empty) = Stack (push’ x s) push’ pop top empty pop :: Stack a -> Stack a pop (Stack s push pop’ top empty) = Stack (pop’ s) push pop’ top empty A Framework for Extended Algebraic Data Types – p.6 Abstract ...