YAGO 4: A Reason-able Knowledge Base

The problem reported in this paper is a variant of the classical vehicle routing problem, where customer requests for a transportation company can be served either by its

In Section 2, we remind the basics on the plain parareal in time algorithm including the current state of the art on the stability and convergence analysis of the algorithm; we use

Previously, one- time digital signatures based on hash functions involved hundreds of hash function computations for each signature; we show that given online ac- cess to a

We plan to improve the methodology presented in this paper by following three main directions: the first is to automatically remove some noise from the profile (e.g., by deleting

Recent unpublished work of Haselgrove in England is being devoted to the deter- mination of the early roots to considerable accuracy by electronic digital

Unlike DBpedia, which relies on a larger user base for crowdsourcing an explicit schema and extraction rules, and the “one-page-per-entity” assumption, DBkWik has to address

By annotating judgments of the European Court of Human Rights, we have aligned an ontology of the le- gal domain, LKIF, to YAGO, we have thus populated LKIF in order to train a

It is plain that we are not only acquaintcd with the complex " Self-acquainted-with-A," but we also know the proposition "I am acquainted with A." Now here the