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: "modelling mixed discrete continuous domains for planning"
  Abstract: In this paper we present PDDL+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of PDDL+, showing that the language makes convenient the modelling of complex time-dependent effects. We provide a formal semantics for PDDL+ by mapping planning instances into constructs of hybrid automata. Using the syntax of HAs as our semantic model we construct a semantic mapping to labelled transition systems to complete the formal interpretation of PDDL+ planning instances.#R##N##R##N#An advantage of building a mapping from PDDL+ to HA theory is that it forms a bridge between the Planning and Real Time Systems research communities. One consequence is that we can expect to make use of some of the theoretical properties of HAs. For example, for a restricted class of HAs the Reachability problem (which is equivalent to Plan Existence) is decidable.#R##N##R##N#PDDL+ provides an alternative to the continuous durative action model of PDDL2.1, adding a more flexible and robust model of time-dependent behaviour.

Connected through hyperedge HE-1 (induced by source paper "timeline based planning expressiveness and complexity"):
  with members:
    - "a new rule for ltl tableaux"
    - "sat based explicit ltl reasoning"
    - "an on the fly tableau based decision procedure for pdl satisfiability"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the ff planning system fast plan generation through heuristic search"
    - "clausal temporal resolution"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-2 (induced by source paper "task assisted motion planning in partially observable domains"):
  with members:
    - "ffrob leveraging symbolic planning for efficient task and motion planning"

Connected through hyperedge HE-3 (induced by source paper "on the manipulation of articulated objects in human robot cooperation scenarios"):
  with members:
    - "goal inference improves objective and perceived performance in human robot collaboration"
    - "combining self supervised learning and imitation for vision based rope manipulation"
    - "ai challenges in human robot cognitive teaming"
    - "flexible human robot cooperation models for assisted shop floor tasks"
    - "a description logic primer"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the symbol grounding problem"

Connected through hyperedge HE-4 (induced by source paper "reasoning about discrete and continuous noisy sensors and effectors in dynamical systems"):
  with members:
    - "robot location estimation in the situation calculus"
    - "reasoning about probabilities in dynamic systems using goal regression"
    - "action networks a framework for reasoning about actions and change under uncertainty"
    - "probabilistic reasoning with answer sets"
    - "decision theoretic planning structural assumptions and computational leverage"
    - "reasoning about noisy sensors and effectors in the situation calculus"

Connected through hyperedge HE-5 (induced by source paper "stripstream integrating symbolic planners and blackbox samplers"):
  with members:
    - "sampling based methods for factored task and motion planning"
    - "the fast downward planning system"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"
    - "the 3rd international planning competition results and analysis"

Connected through hyperedge HE-6 (induced by source paper "a constraint based encoding for domain independent temporal planning"):
  with members:
    - "extracting lifted mutual exclusion invariants from temporal planning domains"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-7 (induced by source paper "behavior and path planning for the coalition of cognitive robots in smart relocation tasks"):
  with members:
    - "grid based angle constrained path planning"
    - "theta any angle path planning on grids"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "the fast downward planning system"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the ff planning system fast plan generation through heuristic search"
    - "the symbol grounding problem"

Connected through hyperedge HE-8 (induced by source paper "casp solutions for planning in hybrid domains"):
  with members:
    - "planning and scheduling in hybrid domains using answer set programming"
    - "asp modulo csp the clingcon system"
    - "plan based policies for efficient multiple battery load management"
    - "colin planning with continuous linear numeric change"
    - "stable models and an alternative logic programming paradigm"

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)