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 "timeline based planning expressiveness and complexity"):
  Abstract: Timeline-based planning is an approach originally developed in the context of space mission planning and scheduling, where problem domains are modelled as systems made of a number of independent but interacting components, whose behaviour over time, the timelines, is governed by a set of temporal constraints. This approach is different from the action-based perspective of common PDDL-like planning languages. Timeline-based systems have been successfully deployed in a number of space missions and other domains. However, despite this practical success, a thorough theoretical understanding of the paradigm was missing. #R##N#This thesis fills this gap, providing the first detailed account of formal and computational properties of the timeline-based approach to planning. In particular, we show that a particularly restricted variant of the formalism is already expressive enough to compactly capture action-based temporal planning problems. Then, finding a solution plan for a timeline-based planning problem is proved to be EXPSPACE-complete. #R##N#Then, we study the problem of timeline-based planning with uncertainty, that include external components whose behaviour is not under the control of the planned system. We identify a few issues in the state-of-the-art approach based on flexible plans, proposing timeline-based games, a more general game-theoretic formulation of the problem, that addresses those issues. We show that winning strategies for such games can be found in doubly-exponential time. #R##N#Then, we study the expressiveness of the formalism from a logic point of view, showing that (most of) timeline-based planning problems can be captured by Bounded TPTL with Past, a fragment of TPTL+P that, unlike the latter, keeps an EXPSPACE satisfiability problem. The logic is introduced and its satisfiabilty problem is solved by extending a recent one-pass tree-shaped tableau method for LTL.

Includes members:
  Member "a new rule for ltl tableaux":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "one pass and tree shaped tableau systems for tptl and tptlb past")
  Member "sat based explicit ltl reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a parallel linear temporal logic tableau")
  Member "an on the fly tableau based decision procedure for pdl satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exptime tableaux for type pdl")
  Member "modelling mixed discrete continuous domains for planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "task assisted motion planning in partially observable domains")
  Member "pddl2 1 an extension to pddl for expressing temporal planning domains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "clausal temporal resolution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "extracting unsatisfiable cores for ltl via temporal resolution")
  Member "the computational complexity of probabilistic planning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a rate distortion framework for explaining neural network decisions")

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)