Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
In this paper we describe the Automatic Task Demonstration Generator (ATDG), a system implemented into a software prototype for teaching the operation of a robot manipulator deplo...
Khaled Belghith, Benjamin Auder, Froduald Kabanza,...
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
— This work is the first attempt to investigate the neural dynamics of a simulated robotic agent engaged in minimally cognitive tasks by employing evolved instances of the Kuram...