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: "a heuristic search algorithm for solving first order mdps"
  Abstract: We present a heuristic search algorithm for solving first-order MDPs (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating states individually, and heuristic search that avoids evaluating all states. Firstly, we apply state abstraction directly on the FOMDP avoiding propositionalization. Such kind of abstraction is referred to as firstorder state abstraction. Secondly, guided by an admissible heuristic, the search is restricted only to those states that are reachable from the initial state. We demonstrate the usefullness of the above techniques for solving FOMDPs on a system, referred to as FCPlanner, that entered the probabilistic track of the International Planning Competition (IPC'2004).

Connected through hyperedge HE-1 (induced by source paper "practical linear value approximation techniques for first order mdps"):
  with members:
    - "exploiting first order regression in inductive policy selection"
    - "approximate linear programming for first order mdps"
    - "mgpt a probabilistic planner based on heuristic search"
    - "efficient solution algorithms for factored mdps"
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-2 (induced by source paper "planning with noisy probabilistic relational rules"):
  with members:
    - "the factored frontier algorithm for approximate inference in dbns"
    - "exploiting first order regression in inductive policy selection"
    - "first order decision diagrams for relational mdps"
    - "learning symbolic models of stochastic domains"
    - "probabilistic planning via heuristic forward search and weighted model counting"
    - "approximate policy iteration with a policy language bias solving relational markov decision processes"
    - "the ff planning system fast plan generation through heuristic search"
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-3 (induced by source paper "decision theoretic planning with non markovian rewards"):
  with members:
    - "spudd stochastic planning using decision diagrams"
    - "implementation and comparison of solution methods for decision processes with non markovian rewards"
    - "symbolic generalization for on line planning"
    - "engineering a conformant probabilistic planner"
    - "mgpt a probabilistic planner based on heuristic search"
    - "the ff planning system fast plan generation through heuristic search"
    - "decision theoretic planning structural assumptions and computational leverage"

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