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 条
  • [31] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 203 - 214
  • [32] On the computation of the disjunctive well-founded semantics
    Johnson, C.A.
    1600, Kluwer Academic Publishers (26):
  • [33] Well-founded semantics for hybrid rules
    Drabent, Wlodzimierz
    Maluszynski, Jan
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 1 - +
  • [34] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    INFORMATION AND COMPUTATION, 2009, 207 (09) : 945 - 967
  • [35] A sufficient condition for strong equivalence under the well-founded semantics
    Nomikos, C
    Rondogiannis, P
    Wadge, WW
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 414 - 415
  • [36] Linear tabulated resolution for the well-founded semantics
    Shen, YD
    Yuan, LY
    You, JH
    Zhou, NF
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1999, 1730 : 192 - 205
  • [37] The well-founded semantics is the principle of inductive definition
    Denecker, M
    LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 : 1 - 16
  • [38] Fuzzy unification and argumentation for well-founded semantics
    Schweimeier, R
    Schroeder, M
    SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 102 - 121
  • [39] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [40] Contradiction removal within well-founded semantics
    Pereira, L.M.
    Alferes, J.J.
    Aparicio, J.N.
    Logic Programming and Non-monotonic Reasoning - Proceedings, 1991,