Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Abstract. This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undevel...
Abstract. The problem of averaging outcomes under several scenarios to form overall objective functions is of considerable importance in decision support under uncertainty. The fuz...
Discovery is a central reasoning task in service-oriented architectures, concerned with detecting Web services that are usable for solving a given request. This paper presents two ...
Michael Stollberg, Uwe Keller, Holger Lausen, Stij...