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 "on termination confluence and consistent chr based type inference"):
  Abstract: We consider the application of Constraint Handling Rules (CHR) for the specification of type inference systems, such as that used by Haskell. Confluence of CHR guarantees that the answer provided by type inference is correct and consistent. The standard method for establishing confluence relies on an assumption that the CHR program is terminating. However, many examples in practice give rise to non-terminating CHR programs, rendering this method inapplicable. Despite no guarantee of termination or confluence, the Glasgow Haskell Compiler (GHC) supports options that allow the user to proceed with type inference anyway, e.g. via the use of the  UndecidableInstances  flag. In this paper we formally identify and verify a set of relaxed criteria, namely  range-restrictedness ,  local confluence , and  ground termination , that ensure the consistency of CHR-based type inference that maps to potentially non-terminating CHR programs.

Includes members:
  Member "smchr satisfiability modulo constraint handling rules":
    also connected through other hyperedges:
      (none)
  Member "diagrammatic confluence for constraint handling rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on proving confluence modulo equivalence for constraint handling rules")
  Member "co inductive semantics for constraint handling rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diagrammatic confluence for constraint handling rules")
  Member "as time goes by constraint handling rules a survey of chr research from 1998 to 2007":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on proving confluence modulo equivalence for constraint handling rules")

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.PL(Programming Languages)