We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
Abstract. The alignment of different ontologies requires the specification, representation and execution of translation rules. The rules need to integrate translations at the lexic...
Fernando Silva Parreiras, Steffen Staab, Simon Sch...
Abstract. In this paper we discuss about composing services from standard suites of applications for personal data management in mobile devices. We propose a data model and an inte...
Augusto Celentano, Stefano Faralli, Fabio Pittarel...
We propose a method to automatically transform synchronous data flow diagrams into synchronous block diagrams. The idea is to use triggers, a mechanism that allows a block to be f...