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 条
  • [41] SLT-Resolution for the Well-Founded Semantics
    Yi-Dong Shen
    Li-Yan Yuan
    Jia-Huai You
    Journal of Automated Reasoning, 2002, 28 : 53 - 97
  • [42] 2 SIMPLE CHARACTERIZATIONS OF WELL-FOUNDED SEMANTICS
    PRZYMUSINSKI, TC
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 449 - 462
  • [43] SLT-resolution for the well-founded semantics
    Shen, YD
    Yuan, LY
    You, JH
    JOURNAL OF AUTOMATED REASONING, 2002, 28 (01) : 53 - 97
  • [44] Interdefinability of defeasible logic and logic programming under the well-founded semantics
    Maier, Frederick
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2013, 13 : 107 - 142
  • [45] XSB: A system for efficiently computing well-founded semantics
    Rao, P
    Sagonas, K
    Swift, T
    Warren, DS
    Freire, J
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1997, 1265 : 430 - 440
  • [46] EFFICIENT TOP-DOWN COMPUTATION OF QUERIES UNDER THE WELL-FOUNDED SEMANTICS
    CHEN, WD
    SWIFT, T
    WARREN, DS
    JOURNAL OF LOGIC PROGRAMMING, 1995, 24 (03): : 161 - 199
  • [47] Epistemic foundation of the well-founded semantics over bilattices
    Loyer, Y
    Straccia, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 513 - 524
  • [48] The approximate well-founded semantics for logic programs with uncertainty
    Loyer, Y
    Straccia, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 541 - 550
  • [49] ADDING CLOSED WORLD ASSUMPTIONS TO WELL-FOUNDED SEMANTICS
    PEREIRA, LM
    ALFERES, JJ
    APARICIO, JN
    THEORETICAL COMPUTER SCIENCE, 1994, 122 (1-2) : 49 - 68
  • [50] The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited
    Denecker, Marc
    Vennekens, Joost
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 22 - 31