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 "reasoning about quality and fuzziness of strategic behaviours"):
  Abstract: Temporal logics are extensively used for the specification of on-going behaviours of reactive systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going strategic behaviours in multi-agent systems, and the transition of temporal logics to a quantitative setting, where different satisfaction values enable the specifier to formalise concepts such as certainty or quality. We introduce and study FSL---a quantitative extension of SL (Strategy Logic), one of the most natural and expressive logics describing strategic behaviours. The satisfaction value of an FSL formula is a real value in [0,1], reflecting `how much' or `how well' the strategic on-going objectives of the underlying agents are satisfied. We demonstrate the applications of FSL in quantitative reasoning about multi-agent systems, by showing how it can express concepts of stability in multi-agent systems, and how it generalises some fuzzy temporal logics. We also provide a model-checking algorithm for our logic, based on a quantitative extension of Quantified CTL*.

Includes members:
  Member "strategy logic with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconfigurable interaction for mas modelling")
  Member "admissibility in quantitative graph games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games")
  Member "high quality synthesis against stochastic environments":
    also connected through other hyperedges:
      (none)
  Member "assume admissible synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games")
  Member "discounting in ltl":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a counting semantics for monitoring ltl specifications over finite traces")
  Member "quantified ctl expressiveness and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timed systems through the lens of logic")
  Member "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "resource logics with a diminishing resource")
  Member "on equilibria in quantitative games with reachability safety objectives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "games with delays a frankenstein approach")

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)