Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both u...
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...