Extended ASP tableaux and rule redundancy in normal logic programs

We introduce an extended tableau calculus for answer set programming (ASP). The proof system is based on the ASP tableaux defined in [Gebser&Schaub, ICLP 2006], with an added extension rule. We investigate the power of Extended ASP Tableaux both theoretically and empirically. We study the relationship of Extended ASP Tableaux with the Extended Resolution proof system defined by Tseitin for sets of clauses, and separate Extended ASP Tableaux from ASP Tableaux by giving a polynomial-length proof for a family of normal logic programs P_n for which ASP Tableaux has exponential-length minimal proofs with respect to n. Additionally, Extended ASP Tableaux imply interesting insight into the effect of program simplification on the lengths of proofs in ASP. Closely related to Extended ASP Tableaux, we empirically investigate the effect of redundant rules on the efficiency of ASP solving. To appear in Theory and Practice of Logic Programming (TPLP).Comment: 27 pages, 5 figures, 1 tabl

Reducing fuzzy answer set programming to model finding in fuzzy logics

In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy ASP solver. A well-known technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly correspond to the answer sets of P. In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners

Effectively Solving NP-SPEC Encodings by Translation to ASP

NP-SPEC is a language for specifying problems in NP in a declarative way. Despite the fact that the semantics of the language was given by referring to Datalog with circumscription, which is very close to ASP, so far the only existing implementations are by means of ECLiPSe Prolog and via Boolean satisfiability solvers. In this paper, we present translations from NP-SPEC into ASP, and provide an experimental evaluation of existing implementations and the proposed translations to ASP using various ASP solvers. The results show that translating to ASP clearly has an edge over the existing translation into SAT, which involves an intrinsic grounding process. We also argue that it might be useful to incorporate certain language constructs of NPSPEC into mainstream ASP

Testicular endocrine activity is upregulated by D-Aspartic acid in the green frog Rana esculenta

This study investigated the involvement of D-aspartic acid (D-Asp) in testicular steroidogenesis of the green frog Rana esculenta and its effect on stimulation of thumb pad morphology and glandular activity, a typical testosterone-dependent secondary sexual characteristic in this amphibian species. In the testis, D-Asp concentrations vary significantly during the reproductive cycle: they are low in pre- and post-reproductive periods, but reach peak levels in the reproductive period (140-236 nmol/g wet tissue). Moreover, the concentrations of D-Asp in the testis through the sexual cycle positively match the testosterone levels in the gonad and the plasma. The racemase activity evaluated during the cycle expresses its peak when D-Asp and testosterone levels are highest, that is, during the reproductive period, confirming the synthesis of D-Asp from L-Asp by an aspartate racemase. Short-term in vivo experiments consisting of a single injection of D-Asp (2.0 micro mol/g body weight) demonstrated that this amino acid accumulates significantly in the testis, and after 3 h its uptake is coupled with a testosterone increase in both testis and plasma. Moreover, within 18 h of amino acid administration, the D-Asp concentration in the testis decreased along with the testosterone titer to prestimulation levels. Other amino acids (L-Asp, D-Glu and L-Glu) used instead of D-Asp were ineffective, confirming that the significant increase in testicular testosterone was a specific feature of this amino acid. In long-term experiments, D-Asp had been administered chronically to frogs caught during the three phases of the reproductive cycle, inducing testosterone increase and 17beta-estradiol decrease in the gonad during the pre- and post-reproductive period, and vice versa during the reproductive period

Disjunctive ASP with Functions: Decidable Queries and Effective Computation

Querying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASP^{fs}). We show that query answering in this setting is decidable, if the query is finitely recursive (ASP^{fs}_{fr}). Our proof yields also an effective method for query evaluation. It is done by extending the magic set technique to ASP^{fs}_{fr}. We show that the magic-set rewritten program is query equivalent to the original one (under both brave and cautious reasoning). Moreover, we prove that the rewritten program is also finitely ground, implying that it is decidable. Importantly, finitely ground programs are evaluable using existing ASP solvers, making the class of ASP^{fs}_{fr} queries usable in practice.Comment: 16 pages, 1 figur

Comparative analysis of the immune responses induced by native versus recombinant versions of the ASP-based vaccine against the bovine intestinal parasite Cooperia oncophora

The protective capacities of a native double-domain activation-associated secreted protein (ndd-ASP)-based vaccine against the cattle intestinal nematode Cooperia oncophora has previously been demonstrated. However, protection analysis upon vaccination with a recombinantly produced antigen has never been performed. Therefore, the aim of the current study was to test the protective potential of a Pichia-produced double-domain ASP (pdd-ASP)-based vaccine against C. oncophora. Additionally, we aimed to compare the cellular and humoral mechanisms underlying the vaccine-induced responses by the native (ndd-ASP) and recombinant vaccines. Immunisation of cattle with the native C. oncophora vaccine conferred significant levels of protection after an experimental challenge infection, whereas the recombinant vaccine did not. Moreover, vaccination with ndd-ASP resulted in a higher proliferation of CD4-T cells both systemically and in the small intestinal mucosa when compared with animals vaccinated with the recombinant antigen. In terms of humoral response, although both native and recombinant vaccines induced similar levels of antibodies, animals vaccinated with the native vaccine were able to raise antibodies with greater specificity towards ndd-ASP in comparison with antibodies raised by vaccination with the recombinant vaccine, suggesting a differential immune recognition towards the ndd-ASP and pdd-ASP. Finally, the observation that animals displaying antibodies with higher percentages of recognition towards ndd-ASP also exhibited the lowest egg counts suggests a potential relationship between antibody specificity and protection

A Multi-Engine Approach to Answer Set Programming

Answer Set Programming (ASP) is a truly-declarative programming paradigm proposed in the area of non-monotonic reasoning and logic programming, that has been recently employed in many applications. The development of efficient ASP systems is, thus, crucial. Having in mind the task of improving the solving methods for ASP, there are two usual ways to reach this goal: $(i)$ extending state-of-the-art techniques and ASP solvers, or $(ii)$ designing a new ASP solver from scratch. An alternative to these trends is to build on top of state-of-the-art solvers, and to apply machine learning techniques for choosing automatically the "best" available solver on a per-instance basis. In this paper we pursue this latter direction. We first define a set of cheap-to-compute syntactic features that characterize several aspects of ASP programs. Then, we apply classification methods that, given the features of the instances in a {\sl training} set and the solvers' performance on these instances, inductively learn algorithm selection strategies to be applied to a {\sl test} set. We report the results of a number of experiments considering solvers and different training and test sets of instances taken from the ones submitted to the "System Track" of the 3rd ASP Competition. Our analysis shows that, by applying machine learning techniques to ASP solving, it is possible to obtain very robust performance: our approach can solve more instances compared with any solver that entered the 3rd ASP Competition. (To appear in Theory and Practice of Logic Programming (TPLP).)Comment: 26 pages, 8 figure

Current state of antimicrobial stewardship in children’s hospital emergency departments

BACKGROUND Antimicrobial stewardship programs (ASPs) effectively optimize antibiotic use for inpatients; however, the extent of emergency department (ED) involvement in ASPs has not been described. OBJECTIVE To determine current ED involvement in children's hospital ASPs and to assess beliefs and preferred methods of implementation for ED-based ASPs. METHODS A cross-sectional survey of 37 children's hospitals participating in the Sharing Antimicrobial Resistance Practices collaboration was conducted. Surveys were distributed to ASP leaders and ED medical directors at each institution. Items assessed included beliefs regarding ED antibiotic prescribing, ED prescribing resources, ASP methods used in the ED such as clinical decision support and clinical care guidelines, ED participation in ASP activities, and preferred methods for ED-based ASP implementation. RESULTS A total of 36 ASP leaders (97.3%) and 32 ED directors (86.5%) responded; the overall response rate was 91.9%. Most ASP leaders (97.8%) and ED directors (93.7%) agreed that creation of ED-based ASPs was necessary. ED resources for antibiotic prescribing were obtained via the Internet or electronic health records (EHRs) for 29 hospitals (81.3%). The main ASP activities for the ED included production of antibiograms (77.8%) and creation of clinical care guidelines for pneumonia (83.3%). The ED was represented on 3 hospital ASP committees (8.3%). No hospital ASPs actively monitored outpatient ED prescribing. Most ASP leaders (77.8%) and ED directors (81.3%) preferred implementation of ED-based ASPs using clinical decision support integrated into the EHR. CONCLUSIONS Although ED involvement in ASPs is limited, both ASP and ED leaders believe that ED-based ASPs are necessary. Many children's hospitals have the capability to implement ED-based ASPs via the preferred method: EHR clinical decision support. Infect Control Hosp Epidemiol 2017;38:469-475

Controlled Natural Language Processing as Answer Set Programming: an Experiment

Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that relies on different software components. We investigate in this paper in an experimental way how well answer set programming (ASP) is suited as a unifying framework for parsing a CNL, deriving a formal representation for the resulting syntax trees, and for reasoning with that representation. We start from a list of input tokens in ASP notation and show how this input can be transformed into a syntax tree using an ASP grammar and then into reified ASP rules in form of a set of facts. These facts are then processed by an ASP meta-interpreter that allows us to infer new knowledge