human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "infinite probability computation by cyclic explanation graphs"):
  Abstract: Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to compute an infinite sum of probabilities for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for probabilistic context free grammars (PCFGs) to probabilistic logic programs. Given a top-goal, we search for all proofs with tabling and obtain an explanation graph which compresses them and may be cyclic. We then convert the explanation graph to a set of linear probability equations and solve them by matrix operation. The solution gives us the probability of the top-goal, which, in nature, is an infinite sum of probabilities. Our general approach to prefix probability computation through tabling not only allows to deal with non-PCFGs such as probabilistic left-corner grammars (PLCGs) but has applications such as plan recognition and probabilistic model checking and makes it possible to compute probability for probabilistic models describing cyclic relations. To appear in Theory and Practice of Logic Programming (TPLP).

Includes members:
  Member "model checking with probabilistic tabled logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "xpl an extended probabilistic logic for probabilistic transition systems")
  Member "the pita system tabling and answer subsumption for reasoning under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "value of information in probabilistic logic programs")
  Member "xsb extending prolog with tabled logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tabled typeclass resolution")
  Member "linear tabling strategies and optimizations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tabled typeclass resolution")
  Member "on applying or parallelism and tabling to logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "table space designs for implicit and explicit concurrent tabled evaluation")
  Member "parameter learning of logic programs for symbolic statistical modeling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "value of information in probabilistic logic programs")
  Member "efficient probabilistic top down and left corner parsing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "in order transition based constituent parsing")
  Member "prefix probabilities from stochastic tree adjoining grammars":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the source paper 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)