Outlier detection using default reasoning

Default logics are usually used to describe the regular behavior and normal properties of domain elements. In this paper we suggest, conversely, that the framework of default logics can be exploited for detecting outliers. Outliers are observations expressed by sets of literals that feature unexpected semantical characteristics. These sets of literals are selected among those explicitly embodied in the given knowledge base. Hence, essentially we perceive outlier detection as a knowledge discovery technique. This paper defines the notion of outlier in two related formalisms for specifying defaults: Reiter's default logic and extended disjunctive logic programs. For each of the two formalisms, we show that finding outliers is quite complex. Indeed, we prove that several versions of the outlier detection problem lie over the second level of the polynomial hierarchy. We believe that a thorough complexity analysis, as done here, is a useful preliminary step towards developing effective heuristics and exploring tractable subsets of outlier detection problems.     

Acute alcohol intoxication suppresses natural killer cell activity and promotes tumor metastasis

Alcohol consumption is associated with increased morbidity and mortality related to infectious diseases and malignancy (1-5), although immune mediation of these relationships is controversial. Specifically, the activity of natural killer (NK) cells, which are involved in the resistance to infections and metastasis, can be suppressed in the presence of ethanol in vitro. However, acute consumption or infusion of ethanol in vivo exerts no effects on NK activity assessed in vitro thereafter. Therefore, we have developed and used a method to study the effects of ethanol on NK activity in living rats by using an NK-sensitive metastatic process and selective depletion of NK cells in vivo. Acute ethanol intoxication caused a marked suppression of NK activity in vivo and a tenfold increase in the number of MADB106 tumor metastases. Ethanol had no effect in rats selectively depleted of NK cells or when an NK-insensitive tumor (C4047) was used. These findings suggest that even acute ethanol intoxication markedly suppresses NK activity in the living organism. This suppression may underlie some aspects of the association between alcoholism, infectious disease and malignancies.     

Stress-induced suppression of natural killer cell cytotoxicity in the rat: A naltrexone-insensitive paradigm.

The suppression of natural killer (NK) cell cytotoxicity by footshock stress can be attenuated by opioid antagonists, implicating endogenous opioids in its mediation. A stress paradigm that includes NK suppression that is not blocked by the opioid antagonist naltrexone is reported. This stress paradigm is also shown to cause analgesia and elevated plasma corticosterone levels that are not attenuated by naltrexone. In the first experiment, a significant suppression of NK cell cytotoxicity after forced swimming was demonstrated in Fischer 344 rats treated with either saline or naltrexone, compared with nonstressed controls. Significantly higher corticosterone levels were evident in both stressed groups. In the second experiment, the same stress paradigm was shown to cause significant analgesia in the tail-flick test. It is concluded that opioids need not always be involved in the suppression of NK cell cytotoxicity by stress. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Propositional semantics for disjunctive logic programs

In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory such that each model of the latter corresponds to an answer set, as defined by stable model semantics, of the former. Using this mapping, we show that many queries over HEDLPs can be determined by solving propositional satisfiability problems. Our mapping has several important implications: It establishes the NP-completeness of this class of disjunctive logic programs; it allows existing algorithms and tractable subsets for the satisfiability problem to be used in logic programming; it facilitates evaluation of the expressive power of disjunctive logic programs; and it leads to the discovery of useful similarities between stable model semantics and Clark's predicate completion.     

A Temporal Logic for Proving Properties of Topologically General Executions

We present a generalization of the temporal propositional logic of linear time which is useful for stating and proving properties of the generic execution sequence of a parallel program or a non-deterministic program. The formal system we present is exactly that same as the third of three logics presented by Lehmann and Shelah (Information and Control53, 165–198 (1982)), but we give it a different semantics. The models are tree models of arbitrary size similar to those used in branching time temporal logic. The formulation we use allows us to state properties of the “co-meagre” family of paths, where the term “co-meagre” refers to a set whose complement is of the first category in Baire's classification looking at the set of paths in the model as a metric space. Our system is decidable, sound, and, complete for models of arbitrary size, but it has the finite model property; namely, every sentence having a model has a finite model.     

An incremental algorithm for generating all minimal models

The task of generating minimal models of a knowledge base is at the computational heart of diagnosis systems like truth maintenance systems, and of nonmonotonic systems like autoepistemic logic, default logic, and disjunctive logic programs. Unfortunately, it is NP-hard. In this paper we present a hierarchy of classes of knowledge bases, Ψ₁,Ψ₂,… , with the following properties: first, Ψ₁ is the class of all Horn knowledge bases; second, if a knowledge base T is in Ψk, then T has at most k minimal models, and all of them may be found in time O(lk²), where l is the length of the knowledge base; third, for an arbitrary knowledge base T, we can find the minimum k such that T belongs to Ψk in time polynomial in the size of T; and, last, where K is the class of all knowledge bases, it is the case that , that is, every knowledge base belongs to some class in the hierarchy. The algorithm is incremental, that is, it is capable of generating one model at a time.     

Fear and danger appraisals of a road-crossing scenario: a developmental perspective

Children's actual performance of visual timing task is possibly deficient, and road-crossing training programs focusing on visual timing elements result in questionable improvement in performance. The present study focused on conceptual, rather than perceptual, examination of the visual timing elements of distance and speed, as integrated into appraisals of risks related to a traffic scenario. Preschool children, third-grade children and adults appraised pedestrian fear and danger associated with four scenarios conceptually depicted using a table-top model. Each scenario described either a child or an adult pedestrian approached by a vehicle at various distances (near/far) and speeds (slow/fast). Results suggest that whereas the adult subjects integrated the danger and fear appraisals by giving separate weights to both distance and speed concepts, preschoolers failed to properly realize the danger associated with speed, and third-graders failed to integrate both concepts in their appraisals. In addition, children seem to be unaware of their underprivileged pedestrian status compared to adult pedestrians, as evidenced by similar appraisal patterns for both pedestrian age groups. The safety implications of these findings are discussed.     

On computing minimal models

This paper addresses the problem of computing the minimal models of a given CNF propositional theory. We present two groups of algorithms. Algorithms in the first group are efficient when the theory is almost Horn, that is, when there are few non-Horn clauses and/or when the set of all literals that appear positive in any non-Horn clause is small. Algorithms in the other group are efficient when the theory can be represented as an acyclic network of low-arity relations. Our algorithms suggest several characterizations of tractable subsets for the problem of finding minimal models.This work was partially supported by an IBM graduate fellowship to the first author, by NSF grants IRI-9157636 and IRI-9200918, by Air Force Office of Scientific Research grant AFOSR 900136, by a grant from Xerox Palo Alto research center, and by Toshiba of America. Part of this work was done while the first author was a graduate student at the Cognitive Systems Laboratory, Computer Science Department, University of California, Los Angeles, California, USA.     

The development of sexual dimorphism in natural killer cell activity and resistance to tumor metastasis in the Fischer 344 rat

The development of sexual dimorphism in the number and activity level of natural killer (NK) cells was studied in the inbred Fischer 344 rat from prepubescence to maturity. Additionally, in view of the biological significance of NK cells in controlling cancer, especially the metastatic process, we used a syngeneic mammary tumor (MADB106) to assess the host anti-metastatic activity. This tumor model was used because NK cells control the lung clearance of i.v.-injected MADB106 tumor cells, a process that critically affects the metastatic colonization of these tumor cells in the lungs. The results indicated that although prepubescent (36 days of age) males and females exhibited greater NK cytotoxicity (assessed in vitro) and higher anti-metastatic activity, evidenced by fewer tumor cells retained in the lungs. On the other hand, the mature males (140-170 days of age) displayed greater LGL/NK number and activity per ml blood, retained fewer tumor cells, and developed fewer lung tumor colonies compared to the females. During early postpubescence (63 days of age), a transitional stage between prepubescence and maturity, females and males exhibited equivalent numbers of circulating LGL/NK cells, and females displayed slightly greater NK cytotoxicity per ml blood yet retained somewhat greater numbers of tumor cells compared to the males. Overall, whereas the males exhibited increasing levels of NK number and activity throughout the age span tested, the females, despite displaying greater NK function compared to the males at prepubescence and slight improvement at postpubescence, fell behind the males in these indices of NK function at maturity.