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 "value of information in probabilistic logic programs"):
  Abstract: In medical decision making, we have to choose among several expensive diagnostic tests such that the certainty about a patient's health is maximized while remaining within the bounds of resources like time and money. The expected increase in certainty in the patient's condition due to performing a test is called the value of information (VoI) for that test. In general, VoI relates to acquiring additional information to improve decision-making based on probabilistic reasoning in an uncertain system. This paper presents a framework for acquiring information based on VoI in uncertain systems modeled as Probabilistic Logic Programs (PLPs). Optimal decision-making in uncertain systems modeled as PLPs have already been studied before. But, acquiring additional information to further improve the results of making the optimal decision has remained open in this context. #R##N#We model decision-making in an uncertain system with a PLP and a set of top-level queries, with a set of utility measures over the distributions of these queries. The PLP is annotated with a set of atoms labeled as "observable"; in the medical diagnosis example, the observable atoms will be results of diagnostic tests. Each observable atom has an associated cost. This setting of optimally selecting observations based on VoI is more general than that considered by any prior work. Given a limited budget, optimally choosing observable atoms based on VoI is intractable in general. We give a greedy algorithm for constructing a "conditional plan" of observations: a schedule where the selection of what atom to observe next depends on earlier observations. We show that, preempting the algorithm anytime before completion provides a usable result, the result improves over time, and, in the absence of a well-defined budget, converges to the optimal solution.

Includes members:
  Member "an anytime algorithm for decision making under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "solving limited memory influence diagrams using branch and bound search")
  Member "myopic value of information in influence diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practical context awareness measuring and utilizing the context dependency of mobile usage")
  Member "an approximate nonmyopic computation for value of information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a graph theoretic analysis of information value")
  Member "near optimal nonmyopic value of information in graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the unreasonable effectiveness of the greedy algorithm greedy adapts to sharpness")
  Member "the pita system tabling and answer subsumption for reasoning under uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic dl reasoning with pinpointing formulas a prolog based approach")
  Member "optimal value of information in graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on tractable computation of expected predictions")
  Member "reasoning and planning with sensing actions incomplete information and static causal laws using answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hybrid conditional planning using answer set programming")
  Member "parameter learning of logic programs for symbolic statistical modeling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "constraint based inference in probabilistic logic programs")

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.AI(Artificial Intelligence)