Do dogs rescue their owners from a stressful situation? A behavioral and physiological assessment

Animal Cognition - Rescue behavior is considered a type of pro-social response, defined as a voluntary action directed to benefit another individual who is in a stressful or dangerous situation. In...     

Age influences domestic dog cognitive performance independent of average breed lifespan

Animal Cognition - Across mammals, increased body size is positively associated with lifespan. However, within species, this relationship is inverted. This is well illustrated in dogs (Canis...     

The assessment of individual “Aggressiveness” in pigeons by a variety of means

Pigeons attack or threaten animate and inanimate targets. The assessment of their aggressiveness was studied by exposing them in their home cages to three different stimuli: the experimenter's hand, a live pigeon, and a rear-projected conspecific image when the birds were exposed to intermittent access to food. A positive correlation between the hand test and live pigeon test was evident, but no relationship between either of these responses and the response to a pictorial image was observed. These results combined with other ethological observations cast doubts on the usefulness of schedule-induced responses to pictorial targets in the assessment of the individual aggressiveness in pigeons, but suggest that the hand test is an adequate and reliable procedure for such evaluations.     

Satisfiability Testing for Boolean Formulas Using Δ-trees

The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal form A at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem.