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: "xsb extending prolog with tabled logic programming"
  Abstract: The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However the overriding reasons are practical. TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported. As a result TLP has now been used in a variety of applications from program analysis to querying over the semantic web. This paper provides a survey of TLP and its applications as implemented in XSB Prolog, along with discussion of how XSB supports tabling with dynamically changing code, and in a multi-threaded environment.

Connected through hyperedge HE-1 (induced by source paper "tabled typeclass resolution"):
  with members:
    - "type classes for efficient exact real arithmetic in coq"
    - "type classes for mathematics in type theory"
    - "linear tabling strategies and optimizations"
    - "linear tabulated resolution based on prolog control strategy"

Connected through hyperedge HE-2 (induced by source paper "about epistemic negation and world views in epistemic logic programs"):
  with members:
    - "splitting epistemic logic programs"
    - "query answering in resource based answer set semantics"
    - "revisiting epistemic specifications"
    - "normal forms for answer sets programming"
    - "on the existence of stable models of non stratified logic programs"
    - "transformation based bottom up computation of the well founded model"
    - "extremal problems in logic programming and stable model computation"

Connected through hyperedge HE-3 (induced by source paper "scaling up reasoning and advanced analytics on bigdata"):
  with members:
    - "vicious circle principle and logic programs with aggregates"
    - "clingo asp control preliminary report"
    - "efficient computation of the well founded semantics over big data"
    - "scaling datalog for machine learning on big data"
    - "multi core processors an overview"
    - "relational transducers for declarative networking"
    - "the dlv system for knowledge representation and reasoning"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-4 (induced by source paper "logic programming applications what are the abstractions and implementations"):
  with members:
    - "applp a dialogue on applications of logic programming"
    - "precise complexity guarantees for pointer analysis via datalog with extensions"
    - "the founded semantics and constraint semantics of logic rules"
    - "demand driven incremental object queries"
    - "team building with answer set programming in the gioia tauro seaport"
    - "fo fd extending classical logic with rule based fixpoint definitions"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-5 (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"
    - "the language features and architecture of b prolog"
    - "on applying or parallelism and tabling to logic programs"

Connected through hyperedge HE-6 (induced by source paper "description implementation and evaluation of a generic design for tabled clp"):
  with members:
    - "tchr a framework for tabled clp"
    - "worst case groundness analysis using definite boolean functions"
    - "textbook examples of recursion"

Connected through hyperedge HE-7 (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"
    - "the language features and architecture of b prolog"
    - "the deductive database system ldl"

Connected through hyperedge HE-8 (induced by source paper "predicate specialization for definitional higher order logic programs"):
  with members:
    - "extensional higher order logic programming"

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)