Remco Straatman

Learn More
In this paper we present the following view on problem-solving methods: Problem-solving methods describe an eecient reasoning strategy to achieve a goal by introducing assumptions about the available domain knowledge and the \functionality" of the task. These assumptions characterize a problem-solving method. This diiers from current views on(More)
A problem-solving method describes a reasoning process that efficiently achieves a goal by applying domain knowledge. However , a problem-solving method cannot directly be applied because of the existence of a gap between, on the one hand, a problem-solving method and the domain knowledge it uses, and, on the other hand, a problem-solving method and the(More)
30 from the fact that the environment changes and some of the (implicit) assumptions are no longer valid (cf. [Fensel & Schönegge, submitted]). In consequence, our approach seems to be less limited than it appeared at first glance. Wielinga for helpful discussions that enabled this paper. and Jeff Butler for proof reading the manuscript. We would especially(More)
choose and the range constructs, cf. [7]). Otherwise, current operationalizations and axiomizations of ealgebras are restricted to the case of point-wise updates. A further difference to our approach is that MLPM provides a richer vocabulary to express control over the execution of transitions. The language DESIRE uses the notion of meta-layered(More)