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: "the language features and architecture of b prolog"
  Abstract: B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loop constructs, and tabling. The B-Prolog system is based on the TOAM architecture which differs from the WAM mainly in that (1) arguments are passed old-fashionedly through the stack, (2) only one frame is used for each predicate call, and (3) instructions are provided for encoding matching trees. The most recent architecture, called TOAM Jr., departs further from the WAM in that it employs no registers for arguments or temporary variables, and provides variable-size instructions for encoding predicate calls. This paper gives an overview of the language features and a detailed description of the TOAM Jr. architecture, including architectural support for action rules and tabling.

Connected through hyperedge HE-1 (induced by source paper "table space designs for implicit and explicit concurrent tabled evaluation"):
  with members:
    - "towards multi threaded local tabling using a common table space"
    - "on combining linear based strategies for tabled evaluation of logic programs"
    - "xsb extending prolog with tabled logic programming"
    - "on applying or parallelism and tabling to logic programs"

Connected through hyperedge HE-2 (induced by source paper "top down and bottom up evaluation procedurally integrated"):
  with members:
    - "efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs"
    - "xsb extending prolog with tabled logic programming"
    - "the deductive database system ldl"

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

Connected through hyperedge HE-4 (induced by source paper "on relation between constraint answer set programming and satisfiability modulo theories"):
  with members:
    - "constraint answer set solver ezcsp and why integration schemas matter"
    - "conflict driven asp solving with external sources"
    - "transition systems for model generators a unifying approach"
    - "weight constraints as nested expressions"

Connected through hyperedge HE-5 (induced by source paper "tabling with sound answer subsumption"):
  with members:
    - "xsb extending prolog with tabled logic programming"

Connected through hyperedge HE-6 (induced by source paper "declaratively solving google code jam problems with picat"):
  with members:
    - "combinatorial search with picat"
    - "declaratively solving tricky google code jam problems with prolog based eclipse clp system"

Connected through hyperedge HE-7 (induced by source paper "the third open answer set programming competition"):
  with members:
    - "detecting inconsistencies in large biological networks with answer set programming"
    - "the dlv system for knowledge representation and reasoning"
    - "the fast downward planning system"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-8 (induced by source paper "combinatorial search with picat"):
  with members:
    - "using tabled logic programming to solve the petrobras planning problem"
    - "linear tabling strategies and optimizations"

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)