human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "sicstus prolog the first 25 years"
  Abstract: SICStus Prolog has evolved for nearly 25 years. This is an appropriate point in time for revisiting the main language and design decisions, and try to distill some lessons. SICStus Prolog was conceived in a context of multiple, conflicting Prolog dialect camps and a fledgling standardization effort. We reflect on the impact of this effort and role model implementations on our development. After summarizing the development history, we give a guided tour of the system anatomy, exposing some designs that were not published before. We give an overview of our new interactive development environment, and describe a sample of key applications. Finally, we try to identify key good and not so good design decisions.

Connected through hyperedge HE-1 (induced by source paper "constraint answer set solver ezcsp and why integration schemas matter"):
  with members:
    - "the language features and architecture of b prolog"
    - "a translational approach to constraint answer set solving"
    - "efficient constraint propagation engines"
    - "weight constraints as nested expressions"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-2 (induced by source paper "exploiting term hiding to reduce run time checking overhead"):
  with members:
    - "practical run time checking via unobtrusive property caching"
    - "higher order symbolic execution via contracts"
    - "xsb extending prolog with tabled logic programming"
    - "eclipse from lp to clp"

Connected through hyperedge HE-3 (induced by source paper "concolic testing in logic programming"):
  with members:
    - "test case generation for object oriented imperative languages in clp"
    - "eclipse from lp to clp"

Connected through hyperedge HE-4 (induced by source paper "logic control on program construction and verification"):
  with members:
    - "proving completeness of logic programs with the cut"
    - "on definite program answers and least herbrand models"
    - "correctness and completeness of logic programs"
    - "on completeness of logic programs"
    - "polytool polynomial interpretations as a basis for termination analysis of logic programs"
    - "proving correctness and completeness of normal programs a declarative approach"
    - "classes of terminating logic programs"

Question: Please tell me which class the center node 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)