Refine
Document Type
- Article (15)
- Doctoral Thesis (1)
- Postprint (1)
Language
- English (17)
Is part of the Bibliography
- yes (17)
Keywords
- Answer set programming (3)
- Answer Set Programming (ASP) (1)
- Constraint Answer Set Programming (CASP) (1)
- Constraint Programming (CP) (1)
- Course timetabling (1)
- Educational timetabling (1)
- Logic programming (1)
- Minimal perturbation problems (1)
- Multi-objective optimization (1)
- Nonmonotonic reasoning (1)
Modulating the Molybdenum Coordination Sphere of Escherichia coli Trimethylamie N-Oxide Reductase
(2018)
The well-studied enterobacterium Escherichia coli present in the human gut can reduce trimethylamine N-oxide (TMAO) to trimethylamine during anaerobic respiration. The TMAO reductase TorA is a monomeric, bis-molybdopterin guanine dinucleotide (bis-MGD) cofactor-containing enzyme that belongs to the dimethyl sulfoxide reductase family of molybdoenzymes. We report on a system for the in vitro reconstitution of TorA with molybdenum cofactors (Moco) from different sources. Higher TMAO reductase activities for TorA were obtained when using Moco sources containing a sulfido ligand at the molybdenum atom. For the first time, we were able to isolate functional bis-MGD from Rhodobacter capsulatus formate dehydrogenase (FDH), which remained intact in its isolated state and after insertion into apo-TorA yielded a highly active enzyme. Combined characterizations of the reconstituted TorA enzymes by electron paramagnetic resonance spectroscopy and direct electrochemistry emphasize that TorA activity can be modified by changes in the Mo coordination sphere. The combination of these results together with studies of amino acid exchanges at the active site led us to propose a novel model for binding of the substrate to the molybdenum atom of TorA.
The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.
The Mo/Cu-dependent CO dehydrogenase (CODH) from Oligotropha carboxidovorans is an enzyme that is able to catalyze both the oxidation of CO to CO2 and the oxidation of H-2 to protons and electrons. Despite the close to atomic resolution structure (1.1 angstrom), significant uncertainties have remained with regard to the reaction mechanism of substrate oxidation at the unique Mo/Cu center, as well as the nature of intermediates formed during the catalytic cycle. So far, the investigation of the role of amino acids at the active site was hampered by the lack of a suitable expression system that allowed for detailed site-directed mutagenesis studies at the active site. Here, we report on the establishment of a functional heterologous expression system of O. carboxidovorans CODH in Escherichia coli. We characterize the purified enzyme in detail by a combination of kinetic and spectroscopic studies and show that it was purified in a form with characteristics comparable to those of the native enzyme purified from O. carboxidovorans. With this expression system in hand, we were for the first time able to generate active-site variants of this enzyme. Our work presents the basis for more detailed studies of the reaction mechanism for CO and H-2 oxidation of Mo/Cu-dependent CODHs in the future.
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo accomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end, clingo offers a new application programming interface that is conveniently accessible via scripting languages. By strictly separating logic and control, clingo also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
teaspoon
(2018)
Answer Set Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling language with high performance solving capacities. We here develop an ASP-based approach to curriculum-based course timetabling (CB-CTT), one of the most widely studied course timetabling problems. The resulting teaspoon system reads a CB-CTT instance of a standard input format and converts it into a set of ASP facts. In turn, these facts are combined with a first-order encoding for CB-CTT solving, which can subsequently be solved by any off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting it to the best known bounds obtained so far via dedicated implementations. Furthermore, we extend the teaspoon system to multi-objective course timetabling and consider minimal perturbation problems.
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests.
We present the new multi-threaded version of the state-of-the-art answer set solver clasp. We detail its component and communication architecture and illustrate how they support the principal functionalities of clasp. Also, we provide some insights into the data representation used for different constraint types handled by clasp. All this is accompanied by an extensive experimental analysis of the major features related to multi-threading in clasp.