Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...
In this paper we describe a complete design methodology for a globally asynchronous onchip communication network connecting both locally-synchronous and asynchronous modules. Sync...
Jens Muttersbach, Thomas Villiger, Wolfgang Fichtn...
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
This paper describes an approach to automatically obtain an HTN planning domain from a well structured learning objects repository and also to apply an HTN planner to obtain IMS Le...
Luis A. Castillo, Lluvia Morales, Arturo Gonz&aacu...
Abstract Relational rule learning algorithms are typically designed to construct classification and prediction rules. However, relational rule learning can be adapted also to subgr...