One More Decidable Class of Finitely Ground Programs

Abstract. When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiation precise for the case of disjunctive programs with function symbols, and introduced the class of “finitely ground ” programs that can be efficiently instantiated. Since that class is undecidable, it is important to find its large decidable subsets. In this paper, we introduce such a subset—the class of argument-restricted programs. It includes, in particular, all finite domain programs, ω-restricted programs, and λ-restricted programs.

Logic Programming and Logarithmic Space

We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic) computation is given via a synctactic restriction, using an encoding of words that derives from proof theory. We show that the acceptance of a word by an observation (the counterpart of a program in the encoding) can be decided within logarithmic space, by reducing this problem to the acyclicity of a graph. We show moreover that observations are as expressive as two-ways multi-heads finite automata, a kind of pointer machines that is a standard model of logarithmic space computation

The DLV System for Knowledge Representation and Reasoning

This paper presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to $\Delta^P_3$-complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof. Furthermore, we illustrate the general architecture of the DLV system which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.Comment: 56 pages, 9 figures, 6 table

Use of hormones in doping and cancer risk

Hormones with anabolic properties such as growth hormone (GH) and insulin-like growth factor-1 (IGF-1) are commonly abused among professional and recreational athletes to enhance physical ability. Despite their adverse effects are well-documented, the use of GH and IGF-1 has recently grown. This article highlights the anabolic activity related to mechanisms of cancer development and progression. GH/IGF-1 axis is able to activate cellular mechanisms that modulate every key stage of cancer formation and progression, such as inhibition of apoptosis, resistance to treatments, and induction of angiogenesis, metastatic process and cell proliferation. Results from pre-clinical studies and epidemiological observations in patients with an excess of GH and IGF-1 production or treated with these hormones showed a positive association with the risk to develop several types of cancer. In conclusion, athletes should be made aware that long-term treatment with doping agents might increase the risk of developing cancer, especially if associated with other licit or illicit drugs and/or high-protein diet

Modular Nonmonotonic Logic Programming Revisited

Abstract. Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually de-pendent input provided by other modules. Moreover, (mutually) recursive module calls are allowed. We define a model-theoretic semantics for this extended setting, show that many desired properties of ordinary logic programming generalize to our modular ASP, and determine the computational complexity of the new formalism. We investigate the relationship of modular programs to disjunctive logic programs with well-defined input/output interface (DLP-functions) and show that they can be embedded into MLPs

A Comparison of the Conditioning Regimens BEAM and FEAM for Autologous Hematopoietic Stem Cell Transplantation in Lymphoma: An Observational Study on 1038 Patients From Fondazione Italiana Linfomi

Abstract Background Carmustine (BCNU)-Etoposide-Citarabine-Melphalan (BEAM) chemotherapy is the standard conditioning regimen for autologous stem cell transplantation (ASCT) in lymphomas. Owing to BCNU shortages, many centers switched to Fotemustine-substituted BEAM (FEAM), lacking proof of equivalence. Methods We conducted a retrospective cohort study in 18 Italian centers to compare safety and efficacy of BEAM and FEAM regimens for ASCT in lymphomas performed from 2008 to 2015. Results We enrolled 1038 patients (BEAM n=607, FEAM n=431), of which 27% had Hodgkin's lymphoma (HL), 14% indolent Non-Hodgkin's lymphoma (iNHL) and 59% aggressive NHL (aNHL). Baseline characteristics including age, sex, stage, B-symptoms, extranodal involvement, previous treatments, response before ASCT, overall conditioning intensity, were well balanced between BEAM and FEAM; notable exceptions were: ASCT year (median: BEAM=2011 vs FEAM=2013, p Conclusions BEAM and FEAM do not appear different in terms of survival and disease control. However, due to concerns of higher toxicity, Fotemustine substitution in BEAM does not seem justified, if not for easier supply