Research suggests that addressing dying patients' existential concerns can improve their quality of life. We aimed to illuminate dying patients' existential concerns about the impending death through a descriptive analysis of semistructured interviews with 17 patients in Danish hospices. The main findings demonstrated how the patients faced the imminent death without being anxious of death but ...

First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics. We present a Skolemization algorithm for model counting problems that eliminates existential quantifiers from a first-order logic theory without changing its weighted model count. For certain subsets of first-order logic, lifted model counters were shown to run in...

This talk will report on the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary struct...

Self is difficult to define because of its multiple, constitutive streams of functional existence. A more comprehensive and expanded definition of self is proposed. The standard bio-psycho-social model of psyche is expanded to biophysical-mental-social and existential self. The total human experience is better understood and explained by adding the existential component. Existential refers to l...

Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [Baget et al., 2010; 2011a]. Query answering is also decidable for description logics [Baader, 2003], which further allow disjunction and functionality constraints (assert that certain relations are ...

Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one...

This paper shows (1) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with negation, product, and existential types, (2) the undecidability of the typability problem in the domain-free polymorphic lambda calculus, and (3) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with function and ...

We suggest a new formalization of the existential termination problem of logic programs under the PROLOG leftmost selection rule and depth-rst computation rule. First of all, we give a characterization of the problem in terms of occurrence sets, by proving that a hprogram; goali existentially terminates if and only if there exists a nite correct occurrence set. Then we show that in order to stu...

We study the following natural variation on the classical universality problem: given an automaton M of some type (DFA/NFA/PDA), does there exist an integer l ≥ 0 such that Σl ⊆ L(M)? The case of an NFA was an open problem since 2009. Here, using a novel and deep construction, we prove that the problem is NEXPTIME-complete, and the smallest such l can be doubly exponential in the number of stat...

Universal/existential quantifiers can be seen as generalization of logical conjunction/disjunction. The universal (existential) quantification of an open proposition is the conjunction (disjunction) of all its possible instantiations. In other words, conjunction (disjunction) is a special kind of universal (existential) quantification where the domain of the variable is restricted to the set of...