In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Robot programmers are faced with the challenging problem of understanding the robot’s view of its world, both when creating and when debugging robot software. As a result tools ...
Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, inc...
We advocate a research approach to determining the conditions of engagement in game simulation that is a multi-disciplinary cultural and scientific inquiry at the juncture of psyc...
Ralph Noble, Kathleen Ruiz, Marc Destefano, Jonath...
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...