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 "logic programming applications what are the abstractions and implementations"):
  Abstract: This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations.

Includes members:
  Member "applp a dialogue on applications of logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extended magic for negation efficient demand driven evaluation of stratified datalog with precise complexity guarantees")
  Member "precise complexity guarantees for pointer analysis via datalog with extensions":
    also connected through other hyperedges:
      (none)
  Member "the founded semantics and constraint semantics of logic rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "knowledge of uncertain worlds programming with logical constraints")
  Member "demand driven incremental object queries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithm diversity for resilient systems")
  Member "team building with answer set programming in the gioia tauro seaport":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "xsb extending prolog with tabled logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tabled typeclass resolution")
  Member "fo fd extending classical logic with rule based fixpoint definitions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a restricted second order logic for non deterministic poly logarithmic time")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the seventh answer set programming competition design and results")

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)