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 "model checking with probabilistic tabled logic programming"):
  Abstract: We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for queries with a finite number of explanations. This restriction prohibits the encoding of probabilistic model checkers, where explanations correspond to executions of the system being model checked. To overcome this restriction, we propose a more general inference algorithm that uses finite generative structures (similar to automata) to represent families of explanations. The inference algorithm computes the probability of a possibly infinite set of explanations directly from the finite generative structure. We have implemented our inference algorithm in XSB Prolog, and use this implementation to encode probabilistic model checkers for a variety of temporal logics, including PCTL and GPL (which subsumes PCTL*). Our experiment results show that, despite the highly declarative nature of their encodings, the model checkers constructed in this manner are competitive with their native implementations.

Includes members:
  Member "inference in probabilistic logic programs with continuous random variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "structured learning modulo theories")
  Member "clp bn constraint logic programming for probabilistic knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic logic neural networks for reasoning")
  Member "the pita system tabling and answer subsumption for reasoning under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "value of information in probabilistic logic programs")
  Member "the magic of logical inference in probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantic relational object tracking")
  Member "cp logic a language of causal probabilistic events and its relation to logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiverse causal reasoning using importance sampling in probabilistic programming")
  Member "model checking probabilistic pushdown automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism")
  Member "bayesian logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "anytime exact belief propagation")

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.LO(Logic in Computer Science)