This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Whenever a pervasive game has to be developed for a group of children an appropriate multi-user setting has to be found. If the pervasive game does not support the children with a...
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...