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 "about epistemic negation and world views in epistemic logic programs"):
  Abstract: In this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with "epistemic operators" and "epistemic negation", and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on the existence and number of world views. We show how to exploit an extended ASP semantics in order to: (i) provide a characterization of world views, different from existing ones; (ii) query world views and query the whole set of world views.

Includes members:
  Member "splitting epistemic logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "structural decompositions of epistemic logic programs")
  Member "query answering in resource based answer set semantics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "better paracoherent answer sets with less resources")
  Member "revisiting epistemic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selp a single shot epistemic logic program solver")
  Member "xsb extending prolog with tabled logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tabled typeclass resolution")
  Member "normal forms for answer sets programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "paracoherent answer set semantics meets argumentation frameworks")
  Member "on the existence of stable models of non stratified logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "answering the why in answer set programming a survey of explanation approaches")
  Member "transformation based bottom up computation of the well founded model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "extended magic for negation efficient demand driven evaluation of stratified datalog with precise complexity guarantees")
  Member "extremal problems in logic programming and stable model computation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "characterizing and computing stable models of logic programs the non stratified case")

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.AI(Artificial Intelligence)