Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...
Davy Van Nieuwenborgh, Marina De Vos, Stijn Heyman...
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...
Mobile users need lightweight devices with low energy consumption. When applications are executed on remote servers instead of locally on the end-user's device, the weight of...
Pieter Simoens, Lien Deboosere, Davy De Winter, Fi...
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...