Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
This paper describes an evaluation of a characterisation framework to analyse mobile work scenarios in order to make corresponding software systems. The framework identifies comple...
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
The requirement of integrating, sharing and reusing legislative information is a research issue gaining priority for governments and institutions. The legal world is complex, heter...
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...