Anytime Computation of Cautious Consequences in Answer Set Programming

Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program. This task is computationally very hard, and there are programs for which computing cautious consequences is not viable in reasonable time. However, current ASP solvers produce the (whole) set of cautious consequences only at the end of their computation. This paper reports on strategies for computing cautious consequences, also introducing anytime algorithms able to produce sound answers during the computation.Comment: To appear in Theory and Practice of Logic Programmin

Learning programs by learning from failures

We describe an inductive logic programming (ILP) approach called learning from failures. In this approach, an ILP system (the learner) decomposes the learning problem into three separate stages: generate, test, and constrain. In the generate stage, the learner generates a hypothesis (a logic program) that satisfies a set of hypothesis constraints (constraints on the syntactic form of hypotheses). In the test stage, the learner tests the hypothesis against training examples. A hypothesis fails when it does not entail all the positive examples or entails a negative example. If a hypothesis fails, then, in the constrain stage, the learner learns constraints from the failed hypothesis to prune the hypothesis space, i.e. to constrain subsequent hypothesis generation. For instance, if a hypothesis is too general (entails a negative example), the constraints prune generalisations of the hypothesis. If a hypothesis is too specific (does not entail all the positive examples), the constraints prune specialisations of the hypothesis. This loop repeats until either (i) the learner finds a hypothesis that entails all the positive and none of the negative examples, or (ii) there are no more hypotheses to test. We introduce Popper, an ILP system that implements this approach by combining answer set programming and Prolog. Popper supports infinite problem domains, reasoning about lists and numbers, learning textually minimal programs, and learning recursive programs. Our experimental results on three domains (toy game problems, robot strategies, and list transformations) show that (i) constraints drastically improve learning performance, and (ii) Popper can outperform existing ILP systems, both in terms of predictive accuracies and learning times.Comment: Accepted for the machine learning journa

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

We consider the incremental computation of minimal unsatisfiable cores (MUCs) of QBFs. To this end, we equipped our incremental QBF solver DepQBF with a novel API to allow for incremental solving based on clause groups. A clause group is a set of clauses which is incrementally added to or removed from a previously solved QBF. Our implementation of the novel API is related to incremental SAT solving based on selector variables and assumptions. However, the API entirely hides selector variables and assumptions from the user, which facilitates the integration of DepQBF in other tools. We present implementation details and, for the first time, report on experiments related to the computation of MUCs of QBFs using DepQBF's novel clause group API.Comment: (fixed typo), camera-ready version, 6-page tool paper, to appear in proceedings of SAT 2015, LNCS, Springe

A Decoding Algorithm for LDPC Codes Over Erasure Channels with Sporadic Errors

none4An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance analyzed. A general single-error multiple-erasure (SEME) decoding algorithm is first described, which may be in principle used with any binary linear block code. The algorithm is optimum whenever the non-erased part of the received word is affected by at most one error, and is capable of performing error detection of multiple errors. An upper bound on the average block error probability under SEME decoding is derived for the linear random code ensemble. The bound is tight and easy to implement. The algorithm is then adapted to LDPC codes, resulting in a simple modification to a previously proposed efficient maximum likelihood LDPC erasure decoder which exploits the parity-check matrix sparseness. Numerical results reveal that LDPC codes under efficient SEME decoding can closely approach the average performance of random codes.noneG. Liva; E. Paolini; B. Matuz; M. ChianiG. Liva; E. Paolini; B. Matuz; M. Chian

Robust integrated design of processes with terminal penalty model predictive controllers

[EN] In this work, a novel methodology for the Integrated Design (ID) of processes with linear Model Predictive Control (MPC) is addressed, providing simultaneously the plant dimensions, the control system parameters and a steady state working point. The MPC chosen operates over infinite horizon in order to guarantee stability and it is implemented with a terminal penalty. The ID methodology considers norm based indexes for controllability, as well as robust performance conditions by using a multi-model approach. Mathematically, the ID is stated as a multiobjective nonlinear constrained optimization problem, tackled in different ways. Particularly, objective functions include investment, operating costs, and dynamical indexes based on the weighted sum of some norms of different closed loop transfer functions of the system. The paper illustrates the application of the proposed methodology with the ID of the activated sludge process of a wastewater treatment plant (WWTP).[ES] Este trabajo aborda una nueva metodología para el Diseño Integrado (ID) de procesos con Control Predictivo Modelo (MPC) lineal, que proporciona simultáneamente las dimensiones de la planta, los parámetros del sistema de control y un punto de trabajo en estado estacionario. El MPC elegido opera sobre horizonte infinito para garantizar la estabilidad. La metodología de ID considera los índices basados en la norma para la controlabilidad, así como las robustas condiciones de rendimiento mediante el uso de un enfoque multi-modelo. Matemáticamente, la ID se declara como un problema de optimización no lineal multiobjetivo restringido, abordado de diferentes maneras. Particularmente, las funciones objetivas incluyen inversión, costos de operación e índices dinámicos basados en la suma ponderada de algunas normas de diferentes funciones de transferencia en bucle cerrado del sistema. El trabajo ilustra la aplicación de la metodología propuesta con el ID del proceso de lodos activados de una planta de tratamiento de aguas residuales (EDAR)