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 "qualitative analysis of pomdps with temporal logic specifications for robotics applications"):
  Abstract: We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with temporal logic specifications. All temporal logic specifications in linear-time temporal logic (LTL) can be expressed as parity objectives. We study the qualitative analysis problem for POMDPs with parity objectives that asks whether there is a controller (policy) to ensure that the objective holds with probability 1 (almost-surely). While the qualitative analysis of POMDPs with parity objectives is undecidable, recent results show that when restricted to finite-memory policies the problem is EXPTIME-complete. While the problem is intractable in theory, we present a practical approach to solve the qualitative analysis problem. We designed several heuristics to deal with the exponential complexity, and have used our implementation on a number of well-known POMDP examples for robotics applications. Our results provide the first practical approach to solve the qualitative analysis of robot motion planning with LTL properties in the presence of uncertainty.

Includes members:
  Member "abstractions and sensor design in partial information reactive controller synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compositional abstraction refinement for control synthesis")
  Member "what is decidable about partially observable markov decision processes with omega regular objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "point based pomdp algorithms improved analysis and implementation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizing sequential medical treatments with auto encoding heuristic search in pomdps")
  Member "heuristic search value iteration for pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "control of noisy differential drive vehicles from time bounded temporal logic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic motion planning under temporal tasks and soft constraints")
  Member "from nondeterministic b uchi and streett automata to deterministic parity automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cautious reinforcement learning with logical constraints")

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.LO(Logic in Computer Science)