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 "logic programming laxness and saturation"):
  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. That correspondence has been developed to model first-order programs in two ways, with lax semantics and saturated semantics, based on locally ordered categories and right Kan extensions respectively. We unify the two approaches, exhibiting them as complementary rather than competing, reflecting the theorem-proving and proof-search aspects of logic programming. While maintaining that unity, we further refine lax semantics to give finitary models of logic programs with existential variables, and to develop a precise semantic relationship between variables in logic programming and worlds in local state.

Includes members:
  Member "productive corecursion in logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "a productivity checker for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structural resolution for abstract compilation of object oriented languages")
  Member "operational semantics of resolution and productivity in horn clause logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proof relevant horn clauses for dependent type inference and term synthesis")
  Member "category theoretic semantics for theorem proving in logic programming embracing the laxness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic foundations of proof refinement")
  Member "bialgebraic semantics for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "category theoretic semantics for theorem proving in logic programming embracing the laxness")
  Member "structural resolution for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "structural resolution for abstract compilation of object oriented languages")

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)