How to Complete an Interactive Configuration Process?

When configuring customizable software, it is useful to provide interactive tool-support that ensures that the configuration does not breach given constraints. But, when is a configuration complete and how can the tool help the user to complete it? We formalize this problem and relate it to concepts from non-monotonic reasoning well researched in Artificial Intelligence. The results are interesting for both practitioners and theoreticians. Practitioners will find a technique facilitating an interactive configuration process and experiments supporting feasibility of the approach. Theoreticians will find links between well-known formal concepts and a concrete practical application.Comment: to appear in SOFSEM 201

Evaluating QBF Solvers: Quantifier Alternations Matter

We present an experimental study of the effects of quantifier alternations on the evaluation of quantified Boolean formula (QBF) solvers. The number of quantifier alternations in a QBF in prenex conjunctive normal form (PCNF) is directly related to the theoretical hardness of the respective QBF satisfiability problem in the polynomial hierarchy. We show empirically that the performance of solvers based on different solving paradigms substantially varies depending on the numbers of alternations in PCNFs. In related theoretical work, quantifier alternations have become the focus of understanding the strengths and weaknesses of various QBF proof systems implemented in solvers. Our results motivate the development of methods to evaluate orthogonal solving paradigms by taking quantifier alternations into account. This is necessary to showcase the broad range of existing QBF solving paradigms for practical QBF applications. Moreover, we highlight the potential of combining different approaches and QBF proof systems in solvers.Comment: preprint of a paper to be published at CP 2018, LNCS, Springer, including appendi

On QBF Proofs and Preprocessing

QBFs (quantified boolean formulas), which are a superset of propositional formulas, provide a canonical representation for PSPACE problems. To overcome the inherent complexity of QBF, significant effort has been invested in developing QBF solvers as well as the underlying proof systems. At the same time, formula preprocessing is crucial for the application of QBF solvers. This paper focuses on a missing link in currently-available technology: How to obtain a certificate (e.g. proof) for a formula that had been preprocessed before it was given to a solver? The paper targets a suite of commonly-used preprocessing techniques and shows how to reconstruct certificates for them. On the negative side, the paper discusses certain limitations of the currently-used proof systems in the light of preprocessing. The presented techniques were implemented and evaluated in the state-of-the-art QBF preprocessor bloqqer.Comment: LPAR 201

Exploiting Resolution-based Representations for MaxSAT Solving

Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early. However, this is not the case in many problem instances, since the whole formula is given to the SAT solver in each call. In this paper, we propose to partition the MaxSAT formula using a resolution-based graph representation. Partitions are then iteratively joined by using a proximity measure extracted from the graph representation of the formula. The algorithm ends when only one partition remains and the optimal solution is found. Experimental results show that this new approach further enhances a state of the art MaxSAT solver to optimally solve a larger set of industrial problem instances

Generalized Totalizer Encoding for Pseudo-Boolean Constraints

Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula. The runtime of the SAT solver on such formula is sensitive to the manner in which the given pseudo-Boolean constraints are encoded. In this paper, we propose generalized Totalizer encoding (GTE), which is an arc-consistency preserving extension of the Totalizer encoding to pseudo-Boolean constraints. Unlike some other encodings, the number of auxiliary variables required for GTE does not depend on the magnitudes of the coefficients. Instead, it depends on the number of distinct combinations of these coefficients. We show the superiority of GTE with respect to other encodings when large pseudo-Boolean constraints have low number of distinct coefficients. Our experimental results also show that GTE remains competitive even when the pseudo-Boolean constraints do not have this characteristic.Comment: 10 pages, 2 figures, 2 tables. To be published in 21st International Conference on Principles and Practice of Constraint Programming 201

aspcud: A Linux Package Configuration Tool Based on Answer Set Programming

We present the Linux package configuration tool aspcud based on Answer Set Programming. In particular, we detail aspcud's preprocessor turning a CUDF specification into a set of logical facts.Comment: In Proceedings LoCoCo 2011, arXiv:1108.609

Less is more: Antibiotics at the beginning of life

Antibiotic exposure at the beginning of life can lead to increased antimicrobial resistance and perturbations of the developing microbiome. Early-life microbiome disruption increases the risks of developing chronic diseases later in life. Fear of missing evolving neonatal sepsis is the key driver for antibiotic overtreatment early in life. Bias (a systemic deviation towards overtreatment) and noise (a random scatter) affect the decision-making process. In this perspective, we advocate for a factual approach quantifying the burden of treatment in relation to the burden of disease balancing antimicrobial stewardship and effective sepsis management

Is there loss or qualitative changes in the expression of thyroid peroxidase protein in thyroid epithelial cancer?

There is disagreement concerning the expression of thyroid peroxidase (TPO) in thyroid cancer, some studies finding qualitative as well as quantitative differences compared to normal tissue. To investigate TPO protein expression and its antigenic properties, TPO was captured from a solubilizate of thyroid microsomes by a panel of murine anti-TPO monoclonal antibodies and detected with a panel of anti-human TPO IgGκ Fab. TPO protein expression in 30 samples of malignant thyroid tissue was compared with TPO from adjacent normal tissues. Virtual absence of TPO expression was observed in 8 cases. In the remaining 22 malignant thyroid tumours the TPO protein level varied considerably from normal to nearly absent when compared to normal thyroid tissue or tissues from patients with Graves' disease (range less than 0.5 to more than 12.5 μg mg−1 of protein). When expressed TPO displayed similar epitopes, to that of TPO from Graves' disease tissue. The results obtained by the TPO capturing method were confirmed by SDS-PAGE and Western blot analysis with both microsomes and their solubilizates. The present results show that in about two-thirds of differentiated thyroid carcinomas, TPO protein is expressed, albeit to a more variable extent than normal; when present, TPO in malignant tissues is immunologically normal. © 2001 Cancer Research Campaignhttp://www.bjcancer.co

Cost impact of procalcitonin-guided decision making on duration of antibiotic therapy for suspected early-onset sepsis in neonates

Abstract Backgrounds The large, international, randomized controlled NeoPInS trial showed that procalcitonin (PCT)-guided decision making was superior to standard care in reducing the duration of antibiotic therapy and hospitalization in neonates suspected of early-onset sepsis (EOS), without increased adverse events. This study aimed to perform a cost-minimization study of the NeoPInS trial, comparing health care costs of standard care and PCT-guided decision making based on the NeoPInS algorithm, and to analyze subgroups based on country, risk category and gestational age. Methods Data from the NeoPInS trial in neonates born after 34 weeks of gestational age with suspected EOS in the first 72 h of life requiring antibiotic therapy were used. We performed a cost-minimization study of health care costs, comparing standard care to PCT-guided decision making. Results In total, 1489 neonates were included in the study, of which 754 were treated according to PCT-guided decision making and 735 received standard care. Mean health care costs of PCT-guided decision making were not significantly different from costs of standard care (€3649 vs. €3616). Considering subgroups, we found a significant reduction in health care costs of PCT-guided decision making for risk category ‘infection unlikely’ and for gestational age ≥ 37 weeks in the Netherlands, Switzerland and the Czech Republic, and for gestational age < 37 weeks in the Czech Republic. Conclusions Health care costs of PCT-guided decision making of term and late-preterm neonates with suspected EOS are not significantly different from costs of standard care. Significant cost reduction was found for risk category ‘infection unlikely,’ and is affected by both the price of PCT-testing and (prolonged) hospitalization due to SAEs

Machine learning used to compare the diagnostic accuracy of risk factors, clinical signs and biomarkers and to develop a new prediction model for neonatal early-onset sepsis

Background: Current strategies for risk stratification and prediction of neonatal early-onset sepsis (EOS) are inefficient and lack diagnostic performance. The aim of this study was to use machine learning to analyze the diagnostic accuracy of risk factors (RFs), clinical signs and biomarkers and to develop a prediction model for culture-proven EOS. We hypothesized that the contribution to diagnostic accuracy of biomarkers is higher than of RFs or clinical signs. Study Design: Secondary analysis of the prospective international multicenter NeoPInS study. Neonates born after completed 34 weeks of gestation with antibiotic therapy due to suspected EOS within the first 72 hours of life participated. Primary outcome was defined as predictive performance for culture-proven EOS with variables known at the start of antibiotic therapy. Machine learning was used in form of a random forest classifier. Results: One thousand six hundred eighty-five neonates treated for suspected infection were analyzed. Biomarkers were superior to clinical signs and RFs for prediction of culture-proven EOS. C-reactive protein and white blood cells were most important for the prediction of the culture result. Our full model achieved an area-under-the-receiver-operating-characteristic-curve of 83.41% (±8.8%) and an area-under-the-precision-recall-curve of 28.42% (±11.5%). The predictive performance of the model with RFs alone was comparable with random. Conclusions: Biomarkers have to be considered in algorithms for the management of neonates suspected of EOS. A 2-step approach with a screening tool for all neonates in combination with our model in the preselected population with an increased risk for EOS may have the potential to reduce the start of unnecessary antibiotics