Integrating Grounding in the Search Process for Answer Set Computing

Answer Set Programming (ASP) is a very convenient paradigmto represent knowledge in Artificial Intelligence and to encode Constraint Satisfaction Problems. For that, the natural way to use ASP is to elaborate a first order logic program with default negation encoding the problem to solve. In a preliminary step this program is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (models) of the program, each answer set encoding one solution of the initial problem. Today, we can say that almost all ASP solvers follow this approach of two steps computation. In this work, we begin by putting in evidence that sometimes the preliminary grounding phase is the only bottleneck for the answer set computation. We show that a lot of useless and counterintuitive work is done in some situations. But, our major contribution is to introduce a new approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. Furthermore, we describe the main lines of the first implementation of our new ASP solver ASPeRiX developed following the introduced methodology

Exploring the influence of basic cognitive skills on the relation between math performance and math anxiety

What causes math anxiety? According to a cognitive deficits view, early weaknesses in basic number and spatial skills lead to poor performance and hence negative affect. A strong version of this view suggests that the relation between math anxiety and math performance among adults will be explained by deficits in spatial and basic number skills. In the present research, we tested a model to account for the relations among math anxiety, math performance, and cognitive skills (i.e., working memory, basic number and spatial skills) among adults (N = 90). We replicated the modest correlations observed between math anxiety and these cognitive skills. However, we did not find a direct link between basic number and spatial skills and math anxiety; instead, these relations were mediated by complex math performance. We conclude by rejecting the hypothesis that math anxiety in adults is linked directly to individual differences in spatial and basic numerical skills and suggest instead that the present results are consistent with the alternative view in which even basic numerical tasks, under certain conditions may evoke an anxiety response and mask skill proficiency. Finally, we note that caution should be applied when extrapolating correlational results to make causal claims about whether cognitive skills may be precursors in the development of math anxiety

Analysis of longitudinal bunching inan FEL driven two-beam accelerator

Recent experiments [1] have explored the use of a free-electron laser (FEL) as a buncher for a microwave two-beam accelerator, and the subsequent driving of a standing-wave rf output cavity. Here we present a deeper analysis of the longitudinal dynamics of the electron bunches as they are transported from the end of the FEL and through the output cavity. In particular, we examine the effect of the transport region and cavity aperture to filter the bunched portion of the beam. [1] T. Lefevre, et. al., Phys. Rev. Lett. 84 (2000), 1188.Comment: 3 pages, 8 figures. Submitted to XX Int'l LINAC Conferenc

The replacement histone H2A.Z in a hyperacetylated form is a feature of active genes in the chicken

The replacement histone H2A.Z is variously reported as being linked to gene expression and preventing the spread of heterochromatin in yeast, or concentrated at heterochromatin in mammals. To resolve this apparent dichotomy, affinity-purified antibodies against the N-terminal region of H2A.Z, in both a triacetylatedandnon- acetylatedstate, areusedin native chromatin immmuno-precipitation experiments with mononucleosomes from three chicken cell types. The hyperacetylated species concentrates at the 50 end of active genes, both tissue specific and housekeeping but is absent from inactive genes, while the unacetylated form is absent from both active and inactive genes. A concentration of H2A.Z is also found at insulators under circumstances implying a link to barrier activity but not to enhancer blocking. Although acetylated H2A.Z is widespread throughout the interphase genome, at mitosis its acetylation is erased, the unmodified form remaining. Thus, although H2A.Z may operate as an epigenetic marker for active genes, its N-terminal acetylation does not

The replacement histone H2A.Z in a hyperacetylated form is a feature of active genes in the chicken

The replacement histone H2A.Z is variously reported as being linked to gene expression and preventing the spread of heterochromatin in yeast, or concentrated at heterochromatin in mammals. To resolve this apparent dichotomy, affinity-purified antibodies against the N-terminal region of H2A.Z, in both a triacetylatedandnon- acetylatedstate, areusedin native chromatin immmuno-precipitation experiments with mononucleosomes from three chicken cell types. The hyperacetylated species concentrates at the 50 end of active genes, both tissue specific and housekeeping but is absent from inactive genes, while the unacetylated form is absent from both active and inactive genes. A concentration of H2A.Z is also found at insulators under circumstances implying a link to barrier activity but not to enhancer blocking. Although acetylated H2A.Z is widespread throughout the interphase genome, at mitosis its acetylation is erased, the unmodified form remaining. Thus, although H2A.Z may operate as an epigenetic marker for active genes, its N-terminal acetylation does not

Possibilistic Uncertainty Handling for Answer Set Programming

In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level associated to each piece of knowledge, we use possibility theory to extend the non monotonic semantics of stable models for logic programs with default negation. By means of a possibility distribution we define a clear semantics of such programs by introducing what is a possibilistic stable model. We also propose a syntactic process based on a fix-point operator to compute these particular models representing the deductions of the program and their certainty. Then, we show how this introduction of a certainty level on each rule of a program can be used in order to restore its consistency in case of the program has no model at all. Furthermore, we explain how we can compute possibilistic stable models by using available softwares for Answer Set Programming and we describe the main lines of the system that we have developed to achieve this goal