• Corpus ID: 13416754

Uncertain Temporal Knowledge Graphs

@inproceedings{Chekol2016UncertainTK,
  title={Uncertain Temporal Knowledge Graphs},
  author={Melisachew Wudage Chekol and Heiner Stuckenschmidt},
  booktitle={URSW@ISWC},
  year={2016}
}
Temporal data can be found in various sources from patient histories, purchase histories, employee histories, to web logs. [] Key Method In this work, we use a numerical extension of Markov logic networks to provide formal syntax and semantics for uncertain temporal kgs. Moreover, we propose a set of datalog constraints with inequalities, that extend the underlying schema of the kgs and help in resolving conflicting facts. Finally, we characterize the complexity of two important queries, maximum a-posteriori…
1 Citations
State-of-the-Art Approaches for Meta-Knowledge Assertion in the Web of Data
TLDR
A systematic review of the various approaches of the four dimensions (namely time, trust, fuzzy, and provenance) to provide an overview of the meta-knowledge assertion techniques in the field of the Semantic Web.

References

SHOWING 1-10 OF 27 REFERENCES
Knowledge expansion over probabilistic knowledge bases
TLDR
The experiments show that ProbKB system outperforms the state-of-the-art inference engine in terms of both performance and quality, and the novel contributions made to achieve scalability and high quality are.
Resolving Temporal Conflicts in Inconsistent RDF Knowledge Bases
TLDR
This paper defines a subclass of first-order constraints with temporal predicates for which the knowledge base is guaranteed to be satisfiable and devise efficient grounding and approximation algorithms for this class of first order constraints, which can be solved within this framework.
Hybrid Acquisition of Temporal Scopes for RDF Data
TLDR
This paper combines two types of information to associate RDF triples with time intervals, relies on temporal information gathered from the document Web by an extension of the fact validation framework DeFacto and harnesses the time information contained in knowledge bases.
Temporal Information Extraction
TLDR
TIE is presented, a novel, information-extraction system, which distills facts from text while inducing as much temporal information as possible, and performs global inference, enforcing transitivity to bound the start and ending times for each event.
Applying Markov Logic for Debugging Probabilistic Temporal Knowledge Bases
TLDR
Given a probabilistic temporal knowledge base, the use of Markov Logic in combination with Allen’s interval calculus to select the most probable consistent subset of facts by computing the MAP state is proposed.
Knowledge vault: a web-scale approach to probabilistic knowledge fusion
TLDR
The Knowledge Vault is a Web-scale probabilistic knowledge base that combines extractions from Web content (obtained via analysis of text, tabular data, page structure, and human annotations) with prior knowledge derived from existing knowledge repositories that computes calibrated probabilities of fact correctness.
Open Information Extraction from the Web
TLDR
Open IE (OIE), a new extraction paradigm where the system makes a single data-driven pass over its corpus and extracts a large set of relational tuples without requiring any human input, is introduced.
Scaling Textual Inference to the Web
TLDR
The Holmes system, which utilizes textual inference over tuples extracted from text to scale TI to a corpus of 117 million Web pages, and its runtime is linear in the size of its input corpus.
Joint Inference for Knowledge Extraction from Biomedical Literature
TLDR
This paper presents the first joint approach for bio-event extraction that obtains state-of-the-art results and adopts a novel formulation by jointly predicting events and arguments, as well as individual dependency edges that compose the argument paths.
Representing and querying validity time in RDF and OWL: A logic-based approach
  • B. Motik
  • Computer Science, Philosophy
    J. Web Semant.
  • 2012
TLDR
This paper presents a logic-based approach for representing validity time in RDF and OWL, and an optimization of the algorithm that is applicable to entailment relations characterized by a set of deterministic rules, such RDF(S), OWL 2 RL/RDF entailment.
...
...