This paper presents a set of experiments designed to test children’s comprehension of simple and complex disjunctions in French and Japanese. First, consistent with previous literature, we found that both groups of children computed fewer ‘not-both’ exclusivity inferences (EIs) than adults. Second, we found clear evidence for conjunctive interpretations of disjunction across both kinds of disju...

Explicit single axioms are presented for Boolean algebra in terms of (1) the Sheffer stroke; (2) disjunction and negation; (3) disjunction, conjunction, and negation; and (4) disjunction, conjunction, negation, 0, and 1. It was previously known that single axioms exist for these systems, but the procedures to generate them are exponential, producing huge equations. Automated deduction technique...

Trut LN. 1999. Early canid domestication: the farm-fox experiment. American Scientist 87:160-169. Summary. In 1959, the Russian geneticist Dmitry K. Belyaev began studying the behavior of captive foxes at a fur farm. Interested in the process of domestication, he experimentally selected foxes on the basis of their reaction to humans. Individual foxes that responded with fear were removed from t...

Constraint programming has been proved as an excellent tool to solve combinatori-al problems in many application areas. Through constraint propagation large parts of the search space can be pruned away. Hard problems are those which involve disjunc-tive constraints introducing non-determinism. While the introduction of choice-points for disjunctive constraints may lead to combinatorial explosio...