In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
Christian Meilicke, Heiner Stuckenschmidt, Ondrej ...
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...