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 "category theoretic semantics for theorem proving in logic programming embracing the laxness"):
  Abstract: A propositional logic program $P$ may be identified with a $P_fP_f$-coalgebra on the set of atomic propositions in the program. The corresponding $C(P_fP_f)$-coalgebra, where $C(P_fP_f)$ is the cofree comonad on $P_fP_f$, describes derivations by resolution. Using lax semantics, that correspondence may be extended to a class of first-order logic programs without existential variables. The resulting extension captures the proofs by term-matching resolution in logic programming. Refining the lax approach, we further extend it to arbitrary logic programs. We also exhibit a refinement of Bonchi and Zanasi's saturation semantics for logic programming that complements lax semantics.

Includes members:
  Member "bialgebraic semantics for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "universal constructions for co relations categories monoidal categories and props")
  Member "proof relevant corecursive resolution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "a type theoretic approach to resolution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "logic programming laxness and saturation")
  Member "structural resolution for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "structural resolution for abstract compilation of object oriented languages")
  Member "exploiting parallelism in coalgebraic logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "logic programming laxness and saturation")
  Member "coalgebraic logic programming from semantics to implementation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "structural resolution for abstract compilation of object oriented languages")
  Member "an interactive semantics of logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "logic programming laxness and saturation")

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)