human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on applying or parallelism and tabling to logic programs"
  Abstract: The past years have seen widening efforts at increasing Prolog's declarativeness and expressiveness. Tabling has proved to be a viable technique to efficiently overcome SLD's susceptibility to infinite loops and redundant subcomputations. Our research demonstrates that implicit or-parallelism is a natural fit for logic programs with tabling. To substantiate this belief, we have designed and implemented an or-parallel tabling engine -- OPTYap -- and we used a shared-memory parallel machine to evaluate its performance. To the best of our knowledge, OPTYap is the first implementation of a parallel tabling engine for logic programming systems. OPTYap builds on Yap's efficient sequential Prolog engine. Its execution model is based on the SLG-WAM for tabling, and on the environment copying for or-parallelism. #R##N#Preliminary results indicate that the mechanisms proposed to parallelize search in the context of SLD resolution can indeed be effectively and naturally generalized to parallelize tabled computations, and that the resulting systems can achieve good performance on shared-memory parallel machines. More importantly, it emphasizes our belief that through applying or-parallelism and tabling to logic programs the range of applications for Logic Programming can be increased.

Connected through hyperedge HE-1 (induced by source paper "table space designs for implicit and explicit concurrent tabled evaluation"):
  with members:
    - "towards multi threaded local tabling using a common table space"
    - "on combining linear based strategies for tabled evaluation of logic programs"
    - "the language features and architecture of b prolog"
    - "xsb extending prolog with tabled logic programming"

Connected through hyperedge HE-2 (induced by source paper "infinite probability computation by cyclic explanation graphs"):
  with members:
    - "model checking with probabilistic tabled logic programming"
    - "the pita system tabling and answer subsumption for reasoning under uncertainty"
    - "xsb extending prolog with tabled logic programming"
    - "linear tabling strategies and optimizations"
    - "parameter learning of logic programs for symbolic statistical modeling"
    - "efficient probabilistic top down and left corner parsing"
    - "prefix probabilities from stochastic tree adjoining grammars"

Connected through hyperedge HE-3 (induced by source paper "gem a distributed goal evaluation algorithm for trust management"):
  with members:
    - "xsb extending prolog with tabled logic programming"
    - "nonmonotonic trust management for p2p applications"
    - "linear tabulated resolution based on prolog control strategy"

Connected through hyperedge HE-4 (induced by source paper "a simple and efficient lock free hash trie design for concurrent tabling"):
  with members:
    - "towards multi threaded local tabling using a common table space"

Connected through hyperedge HE-5 (induced by source paper "clp bn constraint logic programming for probabilistic knowledge"):
  with members:
    - "parameter learning of logic programs for symbolic statistical modeling"
    - "bayesian logic programs"
    - "variational probabilistic inference and the qmr dt network"

Connected through hyperedge HE-6 (induced by source paper "towards multi threaded local tabling using a common table space"):
  with members:
    - "xsb extending prolog with tabled logic programming"

Connected through hyperedge HE-7 (induced by source paper "on the implementation of gnu prolog"):
  with members:
    - "linear tabling strategies and optimizations"

Connected through hyperedge HE-8 (induced by source paper "linear tabling strategies and optimizations"):
  with members:
    - "parameter learning of logic programs for symbolic statistical modeling"
    - "linear tabulated resolution based on prolog control strategy"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.PL(Programming Languages)