We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled determinist...
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Dynamics are an important aspect of agent models. Control of dynamics requires specific methods of specification that have their own specific semantics. This paper addresses speci...
Frances M. T. Brazier, Catholijn M. Jonker, Jan Tr...
We give a formal framework for studying real-time discrete-event systems. It describes concurrent processes as sets of possible behaviors. Compositions of processes are processes ...
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...