2008 IEEE International Conference on Semantic Computing 2008
DOI: 10.1109/icsc.2008.41
|View full text |Cite
|
Sign up to set email alerts
|

Towards LarKC: A Platform for Web-Scale Reasoning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 100 publications
(48 citation statements)
references
References 7 publications
0
48
0
Order By: Relevance
“…As current Semantic Web reasoning systems do not scale to the requirements of emerging applications, it has been acknowledged that there is an urgent need for a distributed platform for massive reasoning that will remove the speed and scalability barriers [17]. Notably, our preliminary work in this direction has resulted in prize-winning contributions to the Billion Triples Challenge at the International Semantic Web Conference in 2008 [2], and the International Scalable Computing Challenge at CCGrid in 2010 [48].…”
Section: Semantic Webmentioning
confidence: 99%
See 1 more Smart Citation
“…As current Semantic Web reasoning systems do not scale to the requirements of emerging applications, it has been acknowledged that there is an urgent need for a distributed platform for massive reasoning that will remove the speed and scalability barriers [17]. Notably, our preliminary work in this direction has resulted in prize-winning contributions to the Billion Triples Challenge at the International Semantic Web Conference in 2008 [2], and the International Scalable Computing Challenge at CCGrid in 2010 [48].…”
Section: Semantic Webmentioning
confidence: 99%
“…Even though the Semantic Web domain is still in its infancy, it already faces problems of staggering proportions [17]. Today, the field is dealing with huge distributed Fig.…”
Section: Semantic Webmentioning
confidence: 99%
“…By relying on the pheromone trails also used by the storage operations, the reasoning operation cannot guarantee that a part of a basic graph pattern that may be present somewhere in the network is actually found. However, at web-scale, incomplete reasoning methods have been found to be advantageous due to the gained robustness and scalability, and partial reasoning results are often useful as well [18,19]. Furthermore, triples that are frequently requested have stronger pheromone paths leading to them, enabling the reasoning operation to find these triples more reliably.…”
Section: Reasoningmentioning
confidence: 99%
“…We are developing the Stream Reasoning vision on top of LarKC [8]. The LarKC platform is aimed to reason on massive heterogeneous information such as social media data.…”
Section: System Architecturementioning
confidence: 99%