Massively Parallel Reasoning under the Well-Founded Semantics using X10

被引:2
|
作者
Tachmazidis, Ilias [1 ]
Cheng, Long [2 ,3 ]
Kotoulas, Spyros [3 ]
Antoniou, Grigoris [1 ]
Ward, Tomas E. [2 ]
机构
[1] Univ Huddersfield, Huddersfield HD1 3DH, W Yorkshire, England
[2] Natl Univ Ireland Maynooth, Maynooth, Kildare, Ireland
[3] IBM Res, Dublin, Ireland
关键词
Well-Founded Semantics; X10; Big Data; Mass Parallelization;
D O I
10.1109/ICTAI.2014.33
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Academia and industry are investigating novel approaches for processing vast amounts of data coming from enterprises, the Web, social media and sensor readings in an area that has come to be known as Big Data. Logic programming has traditionally focused on complex knowledge structures/programs. The question arises whether and how it can be applied in the context of Big Data. In this paper, we study how the well-founded semantics can be computed over huge amounts of data using mass parallelization. Specifically, we propose and evaluate a parallel approach based on the X10 programming language. Our experiments demonstrate that our approach has the ability to process up to 1 billion facts within minutes.
引用
收藏
页码:162 / 169
页数:8
相关论文
共 50 条
  • [1] Hybrid reasoning with rules and constraints under well-founded semantics
    Drabent, Wlodzimierz
    Henriksson, Jakob
    Maluszynski, Jan
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 348 - +
  • [2] Decidability under the well-founded semantics
    Cherchago, Natalia
    Hitzler, Pascal
    Hoelldobler, Steffen
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 269 - +
  • [3] Forgetting under the Well-Founded Semantics
    Alferes, Jose Julio
    Knorr, Matthias
    Wang, Kewen
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013), 2013, 8148 : 36 - 41
  • [4] Constructive negation under the well-founded semantics
    Liu, JY
    Adams, L
    Chen, WD
    JOURNAL OF LOGIC PROGRAMMING, 1999, 38 (03): : 295 - 330
  • [5] Local closed world reasoning with description logics under the well-founded semantics
    Knorr, Matthias
    Alferes, Jose Julio
    Hitzler, Pascal
    ARTIFICIAL INTELLIGENCE, 2011, 175 (9-10) : 1528 - 1554
  • [6] Constructive negation under the well-founded semantics
    Yuan-Ze Univ, Taiwan
    J Logic Program, 3 (295-330):
  • [7] A NONDETERMINISTIC WELL-FOUNDED SEMANTICS
    TORRES, A
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (01) : 37 - 73
  • [8] On Signings and the Well-Founded Semantics
    Maher, Michael J. J.
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2022, 22 (01) : 115 - 127
  • [9] A tutorial on the well-founded semantics
    Van Gelder, A
    PROGRAMMING AND COMPUTER SOFTWARE, 1998, 24 (01) : 32 - 42
  • [10] Aggregation and well-founded semantics
    Osorio, M
    Jayaraman, B
    NON-MONOTONIC EXTENSIONS OF LOGIC PROGRAMMING, 1997, 1216 : 71 - 90