A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
Determining the position of breaks in a sentence is a key task for a text-to-speech (TTS) system. We describe some methods for phrase break prediction in which the whole sentence ...
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
We consider continuous quantities that are used to describe the physical world, such as colour, shape, sound, texture, and spatial and temporal arrangements. Natural languages are...