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: "synthesis of strategies using the hoare logic of angelic and demonic nondeterminism"
  Abstract: We study a propositional variant of Hoare logic that can be used for#N#reasoning about programs that exhibit both angelic and demonic nondeterminism.#N#We work in an uninterpreted setting, where the meaning of the atomic actions is#N#specified axiomatically using hypotheses of a certain form. Our logical#N#formalism is entirely compositional and it subsumes the non-compositional#N#formalism of safety games on finite graphs. We present sound and complete#N#Hoare-style calculi that are useful for establishing partial-correctness#N#assertions, as well as for synthesizing implementations. The computational#N#complexity of the Hoare theory of dual nondeterminism is investigated using#N#operational models, and it is shown that the theory is complete for exponential#N#time.

Connected through hyperedge HE-1 (induced by source paper "constructive hybrid games"):
  with members:
    - "constructive game logic"
    - "an axiomatic approach to liveness for differential equations"
    - "toward structured proofs for dynamic logics"
    - "differential equation axiomatization the impressive power of differential ghosts"
    - "uniform substitution for differential game logic"
    - "differential game logic"
    - "a uniform substitution calculus for differential dynamic logic"

Connected through hyperedge HE-2 (induced by source paper "constructive game logic"):
  with members:
    - "differential game logic"
    - "towards a coalgebraic interpretation of propositional dynamic logic"

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