Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
This paper presents an approach for ontology translation in the O3F ontology framework and a concrete implemented agent that translates between ontologies expressed in OWL. In the...
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
The Question Answering Task requires user interaction. Users can help the system by reformulating the questions, adding information to them or selecting the documents on which the ...
The thresholded t-map produced by the General Linear Model (GLM) gives an effective summary of activation patterns in functional brain images and is widely used for feature selecti...