6 citations · 9 across the 6 of their papers we have counts for
7 papers
On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds
Henrik Forssell, Evgeny Kharlamov, Evgenij Thorstensen
Data exchange heavily relies on the notion of incomplete database instances. Several semantics for such instances have been proposed and include open (OWA), closed (CWA), and open-…
Generating Ontologies from Templates: A Rule-Based Approach for Capturing Regularity
Henrik Forssell, Christian Kindermann, Daniel P. Lupp +2
We present a second-order language that can be used to succinctly specify ontologies in a consistent and transparent manner. This language is based on ontology templates (OTTR), a…
Mapping Data to Ontologies with Exceptions Using Answer Set Programming
Daniel P. Lupp, Evgenij Thorstensen
In ontology-based data access, databases are connected to an ontology via mappings from queries over the database to queries over the ontology. In this paper, we consider mappings…
Structural Decompositions for Problems with Global Constraints
Evgenij Thorstensen
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be…
Tractable Combinations of Global Constraints
David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen +1
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a par…
Lifting Structural Tractability to CSP with Global Constraints
Evgenij Thorstensen
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be…