### Citations

228 | Toward an architecture for never-ending language learning
- Carlson, Betteridge, et al.
- 2010
(Show Context)
Citation Context ... possible. The ultimate goal is to address the web as a source of universal knowledge about the world. Recently a number of large scale knowledge extraction projects have been launched including NELL =-=[2]-=- TEXTRUNNER [3] and Knowitnow [1]. These projects extract more or less accurate facts from webpages building large knowledge bases about the world. Despite the use of high end extarctoin methods, the ... |

160 | Non-standard reasoning services for the debugging of description logic terminologies
- Schlobach, Cornet
- 2003
(Show Context)
Citation Context ...antage of logic-based ontologies are the possibility to check the model for different kinds of logical inconsistencies as possible symptoms of modeling errors. Since the work of Schlohbach and Cornet =-=[19]-=- many researchers have investigated the task of debugging description-logic ontologies, which dies not only include the detection of logical inconsistency, but also the identifying minimal sets of axi... |

112 | Open Information Extraction from the Web
- Etzioni, Banko, et al.
- 2008
(Show Context)
Citation Context ...ultimate goal is to address the web as a source of universal knowledge about the world. Recently a number of large scale knowledge extraction projects have been launched including NELL [2] TEXTRUNNER =-=[3]-=- and Knowitnow [1]. These projects extract more or less accurate facts from webpages building large knowledge bases about the world. Despite the use of high end extarctoin methods, the resulting model... |

73 |
Repairing unsatisfiable concepts in OWL ontologies
- Kalyanpur, Parsia, et al.
- 2006
(Show Context)
Citation Context ... which dies not only include the detection of logical inconsistency, but also the identifying minimal sets of axioms causing it and removing axioms from the ontology to make it consistent again (e.g. =-=[18, 16, 6, 8]-=-). While computing the cause of an inconsistency is relatively well understood and established techniques from diagnostic reasoning like the hitting set algorithm have been successfully applied and ad... |

70 |
Improving the accuracy and efficiency of map inference for markov logic
- Riedel
- 2008
(Show Context)
Citation Context ...alue of 1.1. The main task is now to find an optimal encoding of the problem into an integer linear programme. Riedel has proposed such a translation as a basis for efficient inferene in Markov logic =-=[17]-=-. As our representation of axioms as predicates and well as the corresponding inference rules can be represented as a Markov logic model, we can use the proposed translation as a basis for solving our... |

62 | KnowItNow: Fast, Scalable Information Extraction from the Web
- Cafarella, Downey, et al.
- 2005
(Show Context)
Citation Context ...o address the web as a source of universal knowledge about the world. Recently a number of large scale knowledge extraction projects have been launched including NELL [2] TEXTRUNNER [3] and Knowitnow =-=[1]-=-. These projects extract more or less accurate facts from webpages building large knowledge bases about the world. Despite the use of high end extarctoin methods, the resulting models still contain mi... |

50 | Scalable knowledge harvesting with high precision and high recall
- Nakashole, Theobald, et al.
- 2011
(Show Context)
Citation Context ...(t) and it is in a diagnosis, then choose an other axiom from that diagnosis as random and replace it with A with probability (m−1) exp(w(A)) (2m exp w(A)−1) First experiments on the PROSPERA Dataset =-=[11]-=- indicate that the method works well also on very large datasets that cannot be handled by optimal algorithms any more. 4 Conclusion: Debugging the Web In this paper, we discussed the problem of debug... |

45 | Diagnosing terminologies
- Schlobach
- 2005
(Show Context)
Citation Context ... which dies not only include the detection of logical inconsistency, but also the identifying minimal sets of axioms causing it and removing axioms from the ontology to make it consistent again (e.g. =-=[18, 16, 6, 8]-=-). While computing the cause of an inconsistency is relatively well understood and established techniques from diagnostic reasoning like the hitting set algorithm have been successfully applied and ad... |

32 |
A general diagnosis method for ontologies, in
- Friedrich, Shchekotykhin
- 2005
(Show Context)
Citation Context ... which dies not only include the detection of logical inconsistency, but also the identifying minimal sets of axioms causing it and removing axioms from the ontology to make it consistent again (e.g. =-=[18, 16, 6, 8]-=-). While computing the cause of an inconsistency is relatively well understood and established techniques from diagnostic reasoning like the hitting set algorithm have been successfully applied and ad... |

27 | Resource-bounded Belief Revision
- Wassermann
- 1999
(Show Context)
Citation Context ... unsolved problem. The classical solution used for instance in the field of believe revision is principle of minimal change that prefers solutions that remove the least number of axioms (compare e.g. =-=[21]-=-. While this approach has theoretical merits, it is not adequate for practical applications. For certain special cases such as debugging ontology mappings we can even observe that the principle of min... |

18 |
Aditya Kalyanpur. Debugging owl ontologies
- Parsia, Sirin
- 2005
(Show Context)
Citation Context |

13 | RockIt: Exploiting parallelism and symmetry for map inference in statistical relational models
- Noessner, Niepert, et al.
- 2013
(Show Context)
Citation Context ...variable in the objective function, the solution of the debugging problem is the ontology that results from excluding all axioms from the model whose value is 0 in the objective function. In our work =-=[15]-=- we have further optimized the translation procedure by translating clauses that share literals into a single constraint with counting variables. This approach has been shown to deliver a significant ... |

12 |
Applying logical constraints to ontology matching
- Meilicke, Stuckenschmidt
- 2007
(Show Context)
Citation Context ...d probabilitic (for computing the probability of a model) inference. It turns out that naive approaches although they work for some special cases such as debugging alignments between small ontologies =-=[9]-=-, fail to scale up to real world ontologies. At this point, we directly benefit from the above explained duality of debugging and inference in log-linear models, because we can build upon existing wor... |

11 | Log-linear description logics
- Niepert, Noessner, et al.
- 2011
(Show Context)
Citation Context ...st normalizing the logical representation, eventually introducing new concept constants and then translating normalized axioms into literals. A complete translation for the logic EL + can be found in =-=[13]-=-. The following example shows our representation of an ontology talking about philosophers and celestial objects: A1 : type(P luto, P hilosopher) (1) A2 : related(born − in, P luto, Athens) (2) A3 : d... |

11 | Debugging OWL Ontologies - A Reality Check
- Stuckenschmidt
- 2008
(Show Context)
Citation Context ...ontain a high number of inconsistencies. While many classical debugging tools already have trouble in more classical settings as we have shown in our study on the practical applicability of debugging =-=[20]-=-, using these tools on sets of automatically generated axioms turns out to be a hopeless endeavor. In this paper, we summarize work on a new approach to ontology debugging that can be seen as a genera... |

9 |
H.: Mining RDF data for property axioms
- Fleischhacker, Völker, et al.
(Show Context)
Citation Context ...objects: A1 : type(P luto, P hilosopher) (1) A2 : related(born − in, P luto, Athens) (2) A3 : domain(born − in, P erson) (3) A4 : type(P luto, DwarfP lanet) (4) A5 : subconcept(P hilosopher, P erson) =-=(5)-=- A6 : subconcept(P lanet, CelestialObject) (6) A7 : subconcept(DwarfP lanet, P lanet) (7) A8 : disjoint(CelestialObject, P erson) (8) Our model further assumes the existence of an entailment relation ... |

9 | Supporting Manual Mapping Revision Using Logical Reasoning
- Meilicke, Stuckenschmidt, et al.
- 2008
(Show Context)
Citation Context ... leaving incorrect ones in. As a consequence, researchers have focused on interactive debugging methods where a human user decides which axioms to remove while being supported by the debugging system =-=[8, 10]-=-. While interactive repair of ontologies is feasible when ontologies are rather small, more recently researchers get interested in debugging ontologies that have been automatically created from text o... |

7 | Elog: A probabilistic reasoner for owl el
- Noessner, Niepert
(Show Context)
Citation Context ... already successfully been implemented in the ELOG reasoning system 1 develop at the university of Mannheim and is ready to use with OWL ontologies that have weights assigned as annotation properties =-=[14]-=-. The second direction is based on the idea of Sampling-based approximate inference that has the potential to scale to very large models. This work, that is based on Markov Chain Monte Carlo Sampling ... |

2 |
Inductive learning of disjointness axioms, in: On the Move to Meaningful Internet Systems
- Fleischhacker, Völker
(Show Context)
Citation Context ...y talking about philosophers and celestial objects: A1 : type(P luto, P hilosopher) (1) A2 : related(born − in, P luto, Athens) (2) A3 : domain(born − in, P erson) (3) A4 : type(P luto, DwarfP lanet) =-=(4)-=- A5 : subconcept(P hilosopher, P erson) (5) A6 : subconcept(P lanet, CelestialObject) (6) A7 : subconcept(DwarfP lanet, P lanet) (7) A8 : disjoint(CelestialObject, P erson) (8) Our model further assum... |

1 | Towards distributed mcmc inference in probabilistic knowledge bases
- Niepert, Meilicke, et al.
- 2012
(Show Context)
Citation Context ...ging of the ontology then corresponds to finding a maximal independent node set with respect to the weights of the axioms. Such an independent node set can now be determined by a Markov chain [7]. In =-=[12]-=- we proposed the following Markov Chain for computing weight-optimal debuggings in the sense of this paper. A markov chain is a stochastic process with discrete time steps that is memoryless in the se... |