In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
The development of flexible and reusable concurrent object-oriented programming ions has suffered from the inherent problem that reusability and extensibility is limited due to pos...
Reality-based interfaces (RBIs) offer the promise of natural interfaces that are intuitive to use. By allowing users to leverage their innate skills and knowledge about the real-p...
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...