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 "approximation fixpoint theory and the well founded semantics of higher order logic programs"):
  Abstract: We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of the type hierarchy. We prove that there exists a bijection between such Fitting-monotonic functions and pairs of two-valued-result functions where the first member of the pair is monotone-antimonotone and the second member is antimonotone-monotone. By deriving an extension of consistent approximation fixpoint theory (Denecker et al. 2004) and utilizing the above bijection, we define an iterative procedure that produces for any given higher-order logic program a distinguished extensional model. We demonstrate that this model is actually a minimal one. Moreover, we prove that our construction generalizes the familiar well-founded semantics for classical logic programs, making in this way our proposal an appealing formulation for capturing the well-founded semantics for higher-order logic programs. This paper is under consideration for acceptance in TPLP.

Includes members:
  Member "extensional semantics for higher order logic programs with negation":
    also connected through other hyperedges:
      (none)
  Member "an analysis of the equational properties of the well founded fixed point":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extensional semantics for higher order logic programs with negation")
  Member "equivalence of two fixed point semantics for definitional higher order logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "extensional semantics for higher order logic programs with negation")
  Member "a fixed point theorem for non monotonic functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an analysis of the equational properties of the well founded fixed point")
  Member "minimum model semantics for extensional higher order logic programming with negation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "extensional semantics for higher order logic programs with negation")
  Member "extensional higher order logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hochc a refutationally complete and semantically invariant system of higher order logic modulo theories")

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)