Explore the vast range of titles available.

Since its inception, research in the field of Artificial Intelligence (AI) has had a fundamentally logical approach; therefore, discussions have taken place to establish a way of distinguishing symbolic AI from sub-symbolic AI, basing the approach instead on the statistical approaches typical of machine learning, deep learning or Bayesian networks [...]

Transient abnormal myelopoiesis (TAM) is a Down syndrome-related pre-leukaemic condition characterized by somatic mutations in the haematopoietic transcription factor GATA-1 that result in exclusive production of its shorter isoform (GATA-1S). Given the common hallmark of altered miRNA expression profiles in haematological malignancies and the pro-leukaemic role of GATA-1S, we aimed to search for miRNAs potentially able to modulate the expression of GATA-1 isoforms. Starting from an in silico prediction of miRNA binding sites in the GATA-1 transcript, miR-1202 came into our sight as potential regulator of GATA-1 expression. Expression studies in K562 cells revealed that miR-1202 directly targets GATA-1, negatively regulates its expression, impairs GATA-1S production, reduces cell proliferation, and increases apoptosis sensitivity. Furthermore, data from TAM and myeloid leukaemia patients provided substantial support to our study by showing that miR-1202 down-modulation is accompanied by increased GATA-1 levels, with more marked effects on GATA-1S. These findings indicate that miR-1202 acts as an anti-oncomiR in myeloid cells and may impact leukaemogenesis at least in part by down-modulating GATA-1S levels.

In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotonic logics for AI. Relations between argumentation framework (AF) semantics and logic programming ones are investigating more and more. In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program. However, if a framework admits a small incoherent part, no stable extension can be provided. To overcome this shortcoming, two semantics generalizing stable extensions have been studied, namely semi-stable and stage. In this paper, we show that another perspective is possible on incoherent AFs, called paracoherent extensions, as they have a counterpart in paracoherent answer set semantics. We compare this perspective with semi-stable and stage semantics, by showing that computational costs remain unchanged, and moreover an interesting symmetric behaviour is maintained.

Answer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems in NP in a compact and elegant way. However, modeling problems beyond NP with ASP is known to be complicated, on the one hand, and limited to problems in $\\[\\Sigma _2^P\\]$ on the other. Inspired by the way Quantified Boolean Formulas extend SAT formulas to model problems beyond NP, we propose an extension of ASP that introduces quantifiers over stable models of programs. We name the new language ASP with Quantifiers (ASP(Q)). In the paper we identify computational properties of ASP(Q); we highlight its modeling capabilities by reporting natural encodings of several complex problems with applications in artificial intelligence and number theory; and we compare ASP(Q) with related languages. Arguably, ASP(Q) allows one to model problems in the Polynomial Hierarchy in a direct way, providing an elegant expansion of ASP beyond the class NP.

Gain-of-function of erythropoietin receptor (EPOR) mutations represent the major cause of primary hereditary polycythemia. EPOR is also found in non-erythroid tissues, although its physiological role is still undefined. We describe a family with polycythemia due to a heterozygous mutation of the EPOR gene that causes a G-->T change at nucleotide 1251 of exon 8. The novel EPOR G1251T mutation results in the replacement of a glutamate residue by a stop codon at amino acid 393. Differently from polycythemia vera, EPOR G1251T CD34(+) cells proliferate and differentiate towards the erythroid phenotype in the presence of minimal amounts of EPO. Moreover, the affected individuals show a 20-fold increase of circulating endothelial precursors. The analysis of erythroid precursor membranes demonstrates a heretofore undescribed accumulation of the truncated EPOR, probably due to the absence of residues involved in the EPO-dependent receptor internalization and degradation. Mutated receptor expression in EPOR-negative cells results in EPOR and Stat5 phosphorylation. Moreover, patient erythroid precursors present an increased activation of EPOR and its effectors, including Stat5 and Erk1/2 pathway. Our data provide an unanticipated mechanism for autosomal dominant inherited polycythemia due to a heterozygous EPOR mutation and suggest a regulatory role of EPO/EPOR pathway in human circulating endothelial precursors homeostasis.

Unit testing frameworks are nowadays considered a best practice, included in almost all modern software development processes, to achieve rapid development of correct specifications. Knowledge representation and reasoning paradigms such as Answer Set Programming (ASP), that have been used in industry-level applications, are not an exception. Indeed, the first unit testing specification language for ASP was proposed in 2011 as a feature of the ASPIDE development environment. Later, a more portable unit testing language was included in the LANA annotation language. In this paper we revisit both languages and tools for unit testing in ASP. We propose a new unit test specification language that allows one to inline tests within ASP programs, and we identify the computational complexity of the tasks associated with checking the various program-correctness assertions. Test-case specifications are transparent to the traditional evaluation, but can be interpreted by a specific testing tool. Thus, we present a novel environment supporting test-driven development of ASP programs.

Ontology-based query answering asks whether a Boolean conjunctive query is satisfied by all models of a logical theory consisting of a relational database paired with an ontology. The introduction of existential rules (i.e., Datalog rules extended with existential quantifiers in rule heads) as a means to specify the ontology gave birth to Datalog+/-, a framework that has received increasing attention in the last decade, with focus also on decidability and finite controllability to support effective reasoning. Five basic decidable fragments have been singled out: linear, weakly acyclic, guarded, sticky, and shy. Moreover, for all these fragments, except shy, the important property of finite controllability has been proved, ensuring that a query is satisfied by all models of the theory iff it is satisfied by all its finite models. In this paper, we complete the picture by demonstrating that finite controllability of ontology-based query answering holds also for shy ontologies, and it therefore applies to all basic decidable Datalog+/- classes. To make the demonstration, we devise a general technique to facilitate the process of (dis)proving finite controllability of an arbitrary ontological fragment.

Abstract solvers are a method to formally analyze algorithms that have been profitably used for describing, comparing and composing solving techniques in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP. In this paper, we design, implement and test novel abstract solutions for cautious reasoning tasks in ASP. We show how to improve the current abstract solvers for cautious reasoning in ASP with new techniques borrowed from backbone computation in SAT, in order to design new solving algorithms. By doing so, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. We implement some of the new solutions in the ASP solver wasp and show that their performance are comparable to state-of-the-art solutions on the benchmark problems from the past ASP Competitions.

Answer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions. Albeit the non-existence of answer sets for some ASP programs can be considered as a modeling feature, it turns out to be a weakness in many other cases, and especially for query answering. Paracoherent answer set semantics extend the classical semantics of ASP to draw meaningful conclusions also from incoherent programs, with the result of increasing the range of applications of ASP. State of the art implementations of paracoherent ASP adopt the semi-equilibrium semantics, but cannot be lifted straightforwardly to compute efficiently the (better) split semi-equilibrium semantics that discards undesirable semi-equilibrium models. In this paper an efficient evaluation technique for computing a split semi-equilibrium model is presented. An experiment on hard benchmarks shows that better paracoherent answer sets can be computed consuming less computational resources than existing methods.

Transient abnormal myelopoiesis (TAM) is a Down syndrome-related pre-leukaemic condition characterized by somatic mutations in the haematopoietic transcription factor GATA-1 that result in exclusive production of its shorter isoform (GATA-1 S ). Given the common hallmark of altered miRNA expression profiles in haematological malignancies and the pro-leukaemic role of GATA-1 S , we aimed to search for miRNAs potentially able to modulate the expression of GATA-1 isoforms. Starting from an in silico prediction of miRNA binding sites in the GATA-1 transcript, miR-1202 came into our sight as potential regulator of GATA-1 expression. Expression studies in K562 cells revealed that miR-1202 directly targets GATA-1, negatively regulates its expression, impairs GATA-1 S production, reduces cell proliferation, and increases apoptosis sensitivity. Furthermore, data from TAM and myeloid leukaemia patients provided substantial support to our study by showing that miR-1202 down-modulation is accompanied by increased GATA-1 levels, with more marked effects on GATA-1 S . These findings indicate that miR-1202 acts as an anti-oncomiR in myeloid cells and may impact leukaemogenesis at least in part by down-modulating GATA-1 S levels.