We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is t...
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...