We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
The TOWL language is a temporal ontology language built on top of OWL-DL that enables descriptions involving time and temporal aspects such as change and state transitions. Extendi...
Viorel Milea, Michael Mrissa, Kees van der Sluijs,...
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing ...
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
We introduce an algorithm that simultaneously estimates a classification function as well as its gradient in the supervised learning framework. The motivation for the algorithm is...