ASP(AC): Answer Set Programming with Algebraic Constraints

Weighted Logic is a powerful tool for the specification of calculations over semirings that depend on qualitative information. Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce Answer Set Programming with Algebraic Constraints (ASP(AC)), where rules may contain constraints that compare semiring values to weighted formula evaluations. Such constraints provide streamlined access to a manifold of constructs available in ASP, like aggregates, choice constraints, and arithmetic operators. They extend some of them and provide a generic framework for defining programs with algebraic computation, which can be fruitfully used e.g. for provenance semantics of datalog programs. While undecidable in general, expressive fragments of ASP(AC) can be exploited for effective problem-solving in a rich framework. This work is under consideration for acceptance in Theory and Practice of Logic Programming.Comment: 32 pages, 16 pages are appendi

On the semantics of hybrid ASP systems based on Clingo

[Abstract]: Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resulting constructs and inferences. This is even more severe when it comes to hybrid ASP languages and systems that are often needed to handle real-world applications. We address this challenge and introduce the concept of abstract and structured theories that allow us to formally elaborate upon their integration with ASP. We then use this concept to make the semantic characterization of clingo’s theory-reasoning framework precise. This provides us with a formal framework in which we can elaborate upon the formal properties of existing hybridizations of clingo, such as clingcon, clingo[dl], and clingo[lp].This work was supported by DFG grant SCHA 550/11, Germany, by grant PID2020-116201GB-I00 funded by MCIN/AEI/ 10.13039/501100011033, Spain, by Xunta de Galicia and the European Union, GPC ED431B 2022/33, by European COST action CA17124 DigForASP, EU, and by the National Science Foundation (NSF 95-3101-0060-402), USA.Xunta de Galicia; ED431B 2022/33Deutsche Forschungsgemeinschaft; SCHA 550/11United States. National Science Foundation; NSF 95-3101-0060-40

Symmetry Breaking for Answer Set Programming

In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process which implicitly represent symmetries and always with exponential compression. These ideas are formulated as preprocessing and implemented in a completely automated flow that first detects symmetries from a given answer set program, adds symmetry-breaking constraints, and can be applied to any existing answer set solver. We demonstrate computational impact on benchmarks versus direct application of the solver. Furthermore, we explore symmetry breaking for answer set programming in two domains: first, constraint answer set programming as a novel approach to represent and solve constraint satisfaction problems, and second, distributed nonmonotonic multi-context systems. In particular, we formulate a translation-based approach to constraint answer set solving which allows for the application of our symmetry detection and symmetry breaking methods. To compare their performance with a-priori symmetry breaking techniques, we also contribute a decomposition of the global value precedence constraint that enforces domain consistency on the original constraint via the unit-propagation of an answer set solver. We evaluate both options in an empirical analysis. In the context of distributed nonmonotonic multi-context system, we develop an algorithm for distributed symmetry detection and also carry over symmetry-breaking constraints for distributed answer set programming.Comment: Diploma thesis. Vienna University of Technology, August 201

A semantical framework for hybrid knowledge bases

In the ongoing discussion about combining rules and ontologies on the Semantic Web a recurring issue is how to combine first-order classical logic with nonmonotonic rule languages. Whereas several modular approaches to define a combined semantics for such hybrid knowledge bases focus mainly on decidability issues, we tackle the matter from a more general point of view. In this paper, we show how Quantified Equilibrium Logic (QEL) can function as a unified framework which embraces classical logic as well as disjunctive logic programs under the (open) answer set semantics. In the proposed variant of QEL, we relax the unique names assumption, which was present in earlier versions of QEL. Moreover, we show that this framework elegantly captures the existing modular approaches for hybrid knowledge bases in a unified way

Relating Constraint Answer Set Programming Languages and Algorithms

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming and constraint logic programming. Soon after that, a CLINGCON language integrating answer set programming and finite domain constraints, as well as an EZCSP language integrating answer set programming and constraint logic programming were introduced. The development of these languages and systems constitutes the appearance of a new AI subarea called constraint answer set programming. All these languages have something in common. In particular, they aim at developing new efficient inference algorithms that combine traditional answer set programming procedures and other methods in constraint programming. Yet, the exact relation between the constraint answer set programming languages and the underlying systems is not well understood. In this paper we address this issue by formally stating the precise relation between several constraint answer set programming languages - AC, CLINGCON, EZCSP - as well as the underlying systems

The Configurable SAT Solver Challenge (CSSC)

It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances. In the international SAT competition series, these parameters are ignored: solvers are run using a single default parameter setting (supplied by the authors) for all benchmark instances in a given track. While this competition format rewards solvers with robust default settings, it does not reflect the situation faced by a practitioner who only cares about performance on one particular application and can invest some time into tuning solver parameters for this application. The new Configurable SAT Solver Competition (CSSC) compares solvers in this latter setting, scoring each solver by the performance it achieved after a fully automated configuration step. This article describes the CSSC in more detail, and reports the results obtained in its two instantiations so far, CSSC 2013 and 2014

Microflow nanoprecipitation of positively charged gastroresistant polymer nanoparticles of Eudragit® RS100: A study of fluid dynamics and chemical parameters

The objective of the present work was to produce gastroresistant Eudragit® RS100 nanoparticles by a reproducible synthesis approach that ensured mono-disperse nanoparticles under the size of 100 nm. Batch and micromixing nanoprecipitation approaches were selected to produce the demanded nanoparticles, identifying the critical parameters affecting the synthesis process. To shed some light on the formulation of the targeted nanoparticles, the effects of particle size and homogeneity of fluid dynamics, and physicochemical parameters such as polymer concentration, type of solvent, ratio of solvent to antisolvent, and total flow rate were studied. The physicochemical characteristics of resulting nanoparticles were studied applying dynamic light scattering (DLS) particle size analysis and electron microscopy imaging. Nanoparticles produced using a micromixer demonstrated a narrower and more homogenous distribution than the ones obtained under similar conditions in conventional batch reactors. Besides, fluid dynamics ensured that the best mixing conditions were achieved at the highest flow rate. It was concluded that nucleation and growth events must also be considered to avoid uncontrolled nanoparticle growth and evolution at the collection vial. Further, rifampicin-encapsulated nanoparticles were prepared using both approaches, demonstrating that the micromixing-assisted approach provided an excellent control of the particle size and polydispersity index. Not only the micromixing-assisted nanoprecipitation promoted a remarkable control in the nanoparticle formulation, but also it enhanced drug encapsulation efficiency and loading, as well as productivity. To the best of our knowledge, this was the very first time that drug-loaded Eudragit® RS100 nanoparticles (NPs) were produced in a continuous fashion under 100 nm (16.5 ± 4.3 nm) using microreactor technology. Furthermore, we performed a detailed analysis of the influence of various fluid dynamics and physicochemical parameters on the size and uniformity of the resulting nanoparticles. According to these findings, the proposed methodology can be a useful approach to synthesize a myriad of nanoparticles of alternative polymers

The reconstitution of the histone octamer

Bibliography: pages 110-126.This thesis describes methodology for the reconstitution of the chicken erythrocyte octamer from acid-denatured histones or the natural H3-H4 tetramer and H2A-H2B dimers. Oligomeric properties of reconstituted octamers were elucidated during column chromatographic and chemical cross-linking studies. The conformational identity of the natural and reconstituted octamers was demonstrated by the ability of all preparations to crystallise as helical octamer tubes. The application of the reconstitution methodology in addressing fundamental problems of chromatin research, was demonstrated during subsequent studies, namely (i) The reconstitution of hybrid histone octamers containing a structural variant of a specific histone. These studies were undertaken to study the effect on histone-histone interactions in hybrid octamers of which erythrocyte H2B was substituted for by sea urchin sperm H2B(l) or erythrocyte H3 and H4 were substituted for by dethiolated H3 and sea urchin sperm H4 respectively. (ii) The reconstitution of an octamer suitable for the sitespecific derivatisation of a specific histone, or covalently labelled with aurothiomalate in a specific histone complex. These studies were concluded to represent general labelling strategies which may be of use in crystallographic or physico-chemical studies of nucleosome structure