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 "antichains for inclusion games"):
  Abstract: We study two-player games played on the infinite graph of sentential forms induced by a context-free grammar (that comes with an ownership partitioning of the non-terminals). The winning condition is inclusion in a regular language for the terminal words derived in maximal plays. Our contribution is an algorithm to compute a finite representation of all plays starting in a non-terminal. The representation is compositional and, once obtained for the non-terminals, immediate to lift to sentential forms. The result has three consequences. It is decidable whether a position is in the winning region of a player. The winning regions have a finite representation. We can compute a winning strategy. Technically, the algorithm is a fixed-point iteration over a novel domain that generalizes the transition monoid to negation-free Boolean formulas. It takes doubly exponential time to check whether a winning strategy exists, which is proven to be the optimal time complexity. We show that this domain is not only expressive but also algorithmically appealing. It is compatible with recent antichain- and subsumption-based optimizations, and admits a lazy evaluation strategy.

Includes members:
  Member "lazy automata techniques for ws1s":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automata terms in a lazy wsks decision procedure technical report")
  Member "saturation algorithms for model checking pushdown systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "good for games omega pushdown automata")
  Member "advanced automata minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "language inclusion for finite prime event structures")

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)