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 "symbolic construction of gr 1 contracts for synchronous systems with full information"):
  Abstract: This work proposes a symbolic algorithm for the construction of assume-guarantee specifications that allow multiple agents to cooperate. Each agent is assigned goals expressed in a fragment of linear temporal logic known as generalized reactivity of rank 1 (GR(1)). These goals may be unrealizable, unless additional assumptions are made by each agent about the behavior of the other agents. The proposed algorithm constructs weakly fair assumptions for each agent, to ensure that they can cooperate successfully. A necessary requirement is that the given goals be cooperatively satisfiable. We prove that there exist games for which the GR(1) fragment with liveness properties over states is not sufficient to ensure realizability from any state in the cooperatively winning set. The obstruction is due to circular dependencies of liveness goals. To prevent circularity, we introduce nested games as a formalism to express specifications with conditional assumptions. The algorithm is symbolic, with fixpoint structure similar to the GR(1) synthesis algorithm, implying time complexity polynomial in the number of states, and linear in the number of recurrence goals.

Includes members:
  Member "how to handle assumptions in synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimally resilient strategies in pushdown safety games")
  Member "environment assumptions for synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")

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)