Contingent planning models a robot that must achieve a goal in a partially observable environment with non-deterministic actions. A solution for this problem is generated by searching in the space of belief states, where a belief state is a set of possible world states. However, if there is an unavoidable dead-end state, the robot will fail to accomplish his task. In this work, rather than limiting

Given a classroom containing a fixed number of students and a fixed number of tables that can be of different sizes, as well as a list of preferred classmates to sit with for each student, the team composition problem in a classroom (TCPC) is the problem of finding an assignment of students to tables in such a way that the preferences of students are maximally-satisfied. In this paper, we first formally

We present a concise source-to-source transformation that introduces justifications for user-defined constraints into the rule-based Constraint Handling Rules (CHR) programming language. There is no need to introduce a new semantics for justifications. This leads to a conservative extension of thelanguage, as we can show the equivalence of rule applications. A scheme of two rules suffices to allow

Static type systems are usually not sufficient to express all requirements on function calls. Hence, contracts with pre- and postconditions can be used to express more complex constraints on operations. Contracts can be checked at run time to ensure that operations are only invoked with reasonablearguments and return intended results. Although such dynamic contract checking provides more reliable program

Reachability logic has been applied to 𝕂 rewrite-rule-based language definitions as a language-generic logic of programs to verify a wide range of sophisticated programs in conventional languages. Here we study how reachability logic can be made not just language-generic, but also rewrite-theory-generic, so that we can verify both conventional programs based on their rewriting logic operational semantics

The spatio-temporal landscape of the plasma membrane regulates activation and signal transduction of membrane bound receptors by restricting their two-dimensional mobility and by inducing receptor clustering. This regulation also extends to complex formation between receptors and adaptor proteins, which are the intermediate signaling molecules involved in cellular signaling that relay the received