We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
We hereby describe DIANE an environment that aims at performing an automatic diagnosis on arithmetic problems depending on the productions of the learners. This work relies on resu...
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
— We examine an abstract formulation of BIST diagnosis in digital logic systems. The BIST diagnosis problem has applications that include identification of erroneous test vector...
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...