Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reyn...
We present Pattern-by-Example (PBE), a graphical language that allows users with little or no knowledge of pattern-matching and functional programming to define complex and optim...
The interpretation of coercion constructions (to begin a book) has been recently considered as resulting from the operation of type changing. For instance, a phrase of type o (obj...
Semantic Web Services (SWSs) aim to improve the possibilities for automated discovery, composition and invocation of Web Services by providing ontology-based service descriptions e...
Houda El Bouhissi, Mimoun Malki, Djelloul Bouchiha
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...