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 "sat based atl satisfiability checking"):
  Abstract: Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a novel method for deciding the satisfiability of formulae of Alternating-time Temporal Logic (ATL). The method presented expands on one for CTL exploit ing SAT Modulo Monotonic Theories solvers. Similarly to the CTL case, our approach appears to be very efficient. The experimental results show that we can quickly test the satisfiability of large ATL formulae that have been out of reach of the existing approaches.

Includes members:
  Member "fixpoint approximation of strategic abilities under imperfect information":
    also connected through other hyperedges:
      (none)
  Member "sat modulo monotonic theories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fouriersat a fourier expansion based algebraic framework for solving hybrid boolean constraints")
  Member "reasoning about knowledge and strategies epistemic strategy logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intelligence in strategic games")
  Member "the expressive power of epistemic μ calculus":
    also connected through other hyperedges:
      (none)
  Member "a decidable fragment of strategy logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reasoning about strategies on the model checking problem")
  Member "model checking atl under imperfect information and perfect recall semantics is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "strategic abilities of asynchronous agents semantic paradoxes and how to tame them")

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)