Objectives:This study used a quasi-experimental method inthe pretest-posttest to evaluate the efficacy of cognitive-existential group therapy on hopefulness in parents of children with cancer. Methods:Thirty parents (24 to 54 years old) of children with cancer were divided randomly into experimental and control groups. Both groups were assessed with Miller Hope Scale (1988), as pre-test. The...

It is shown that the existential theory of G with rational constraints, over an HNN-extension G = 〈H, t; tat = φ(a)(a ∈ A)〉 is decidable, provided that the same problem is decidable in the base group H and that A is a finite group. The positive theory of G is decidable, provided that the existential positive theory of G is decidable and that A and φ(A) are proper subgroups of the base group H w...

We present the architecture and design details of a logic database system that extends functionality in a number of ways. The system supports indefinite (non-Horn) facts in extensional database (EDB) and existential quantification in intensional database (IDB) rules. Semantic query optimization is integrated as part of the query processing module. The system also deals with efficient rule manag...

Bedside psychotherapy with medically ill patients can help counter their demoralization, which is the despair, helplessness, and sense of isolation that many patients experience when affected by illness and its treatments. Demoralization can be usefully regarded as the compilation of different existential postures that position a patient to withdraw from the challenges of illness. A fruitful in...

We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of firstorder and nonrecursive Datalog rewritings for conjunctive queries over OWL2QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we ...

Existential rules have been proposed for representing on-tological knowledge, specifically in the context of Ontology-BasedQuery Answering. Entailment with existential rules is undecidable.We focus in this paper on conditions that ensure the terminationof a breadth-first forward chaining algorithm known as the chase.First, we propose a new tool that allows to extend existing...

This paper investigates some fundamental properties of 2-way alternating multi-counter automata (2amca’s) with only existential (universal) states which have sublinear space and 1 inkdot. It is shown that for any function s(n) ≥ log n such that log s(n) = o(log n), s(n) space-bounded 1-inkdot 2amca’s with only existential states are incomparable with the ones with only universal states, and the...

Using an extension of Wright’s version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.