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 "coinductive uniform proofs"):
  Abstract: Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a systematic analysis of these two kinds of proofs and of their relation was lacking. We propose a general proof-theoretic framework for handling both kinds of coinduction arising in Horn clause logic. To this aim, we propose a coinductive extension of Miller et al framework of uniform proofs and prove its soundness relative to coinductive models of Horn clause logic.

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 "type theory based on dependent inductive and coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "signatures and induction principles for higher inductive inductive types")
  Member "proof relevant corecursive resolution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "refinement type inference via horn constraint optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "combining deduction modulo and logics of fixed point definitions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a higher order abstract syntax approach to verified transformations on functional programs")
  Member "inductive and coinductive components of corecursive functions in coq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a type theoretic approach to resolution")

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)