In this paper, we study the partitioning of constraints in temporal planning problems formulated as mixed-integer nonlinear programming (MINLP) proble...
Diagnosis of discrete-event systems (DESs) may be improved by knowledge-compilation techniques, where a large amount of model-based reasoning is antic...
A key feature of modern optimal planners such as GRAPHPLAN and BLACKBOX is their ability to prune large parts of the search space. Previous Partial Or...
This paper demonstrates how machine learning methods can be applied to deal with a real-world decipherment problem where very little background knowle...
In this paper, we propose that structural learning of a directed acyclic graph can be decomposed into problems related to its decomposed subgraphs. Th...
