Sciweavers

DLOG
2011
14 years 11 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
241
Voted
DLOG
2011
14 years 11 months ago
Correcting Access Restrictions to a Consequence More Flexibly
Recent research has shown that labeling ontologies can be useful for restricting the access to some of the axioms and their implicit consequences. However, the labeling of the axio...
Eldora, Martin Knechtel, Rafael Peñaloza
DLOG
2011
14 years 11 months ago
Two-Dimensional Description Logics of Context
We introduce an extension of Description Logics (DLs) for representing and reasoning about contextualized knowledge. Our formalism is inspired by McCarthy’s theory of formalizing...
Szymon Klarman, Víctor Gutiérrez-Bas...
222
Voted
DLOG
2011
14 years 11 months ago
Relaxed Abduction: Robust Information Interpretation for Incomplete Models
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
144
Voted
DLOG
2011
14 years 11 months ago
On P/NP Dichotomies for EL Subsumption under Relational Constraints
Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular cons...
Agi Kurucz, Frank Wolter, Michael Zakharyaschev
176
Voted
DLOG
2011
14 years 11 months ago
Mapping Data to Higher-Order Description Logic Knowledge Bases
Floriana Di Pinto, Giuseppe De Giacomo, Maurizio L...
DKE
2011
260views Education» more  DKE 2011»
14 years 11 months ago
Analysis on demand: Instantaneous soundness checking of industrial business process models
We report on a case study on control-flow analysis of business process models. We checked 735 industrial business process models from financial services, telecommunications, and...
Dirk Fahland, Cédric Favre, Jana Koehler, N...
248
Voted
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 11 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
220
Voted
DISOPT
2011
176views Education» more  DISOPT 2011»
14 years 11 months ago
Valid inequalities and branch-and-cut for the clique pricing problem
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
Géraldine Heilporn, Martine Labbé, P...
212
Voted
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 11 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük