Sciweavers

DLOG
2011
13 years 3 months ago
On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
Stefan Scheglmann, Carsten Saathoff, Steffen Staab
DLOG
2011
13 years 3 months ago
Repairing Incomplete Reasoners
Abstract. The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems witho...
Giorgos Stoilos, Bernardo Cuenca Grau
DLOG
2011
13 years 3 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
DLOG
2011
13 years 3 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
13 years 3 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...
DLOG
2011
13 years 3 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
DLOG
2011
13 years 3 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
DLOG
2011
13 years 3 months ago
Mapping Data to Higher-Order Description Logic Knowledge Bases
Floriana Di Pinto, Giuseppe De Giacomo, Maurizio L...
GPEM
2010
130views more  GPEM 2010»
13 years 6 months ago
EvAg: a scalable peer-to-peer evolutionary algorithm
Juan Luís Jiménez Laredo, A. E. Eibe...