Four Dimensions of Criticism Against Gender-Fair Language

Sex Roles - The gender-neutral third-person pronoun singular hen was recently introduced in Swedish as a complement to she (hon) and he (han). The initiative to add hen initially received strong...     

For-Me-Ness,For-Us-Ness,and the We-Relationship

Topoi - This article investigates the relationship between for-me-ness and sociality. I start by pointing out some ambiguities in claims pursued by critics that have recently pressed on the...     

Corporate Social Responsibility Practices of Colombian Companies as Perceived by Industrial Engineering Students

Science and Engineering Ethics - This work describes the perceptions that Industrial Engineering students have regarding Colombian firms’ corporate social responsibility (CSR) practices. It...     

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...     

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.