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 "probabilistic relational planning with first order decision diagrams"):
  Abstract: Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diagrams, to capture domain dynamics and value functions. Work on symbolic dynamic programming lifted these ideas to first order logic using several representation schemes. Recent work introduced a first order variant of decision diagrams (FODD) and developed a value iteration algorithm for this representation. This paper develops several improvements to the FODD algorithm that make the approach practical. These include, new reduction operators that decrease the size of the representation, several speedup techniques, and techniques for value approximation. Incorporating these, the paper presents a planning system, FODD-PLANNER, for solving relational stochastic planning problems. The system is evaluated on several domains, including problems from the recent international planning competition, and shows competitive performance with top ranking systems. This is the first demonstration of feasibility of this approach and it shows that abstraction through compact representation is a promising approach to stochastic planning.

Includes members:
  Member "spudd stochastic planning using decision diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum causal entropy specification inference from demonstrations")
  Member "exploiting first order regression in inductive policy selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a heuristic search algorithm for solving first order mdps")
  Member "policy iteration for relational mdps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stochastic planning and lifted inference")
  Member "first order decision diagrams for relational mdps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "qualitative numeric planning reductions and complexity")
  Member "flucap a heuristic search planner for first order mdps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of reasoning with fodd and gfodd")
  Member "approximate policy iteration with a policy language bias solving relational markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized neural policies for relational mdps")
  Member "efficient solution algorithms for factored mdps":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "policy synthesis for factored mdps with graph temporal logic specifications")
  Member "decision theoretic planning structural assumptions and computational leverage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal by design model driven synthesis of adaptation strategies for autonomous systems")

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)