This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Relational database management systems are constantly being extended and augmented to accommodate data in different domains. Recently, with the increasing use of ontology in vario...
Semantic mapping is one of the important components underlying the data sharing systems. As is known, constructing and maintaining such mappings both are necessary yet extremely h...