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 "stepwise debugging of answer set programs"):
  Abstract: We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules. Similar to debugging in imperative languages, where the behaviour of a program is observed during a step-by-step execution, stepping for ASP allows for observing the effects that rule applications have in the computation of an answer set. While the approach is inspired from debugging in imperative programming, it is conceptually different to stepping in other paradigms due to non-determinism and declarativity that are inherent to ASP. In particular, unlike statements in an imperative program that are executed following a strict control flow, there is no predetermined order in which to consider rules in ASP during a computation. In our approach, the user is free to decide which rule to consider active in the next step following his or her intuition. This way, one can focus on interesting parts of the debugging search space. Bugs are detected during stepping by revealing differences between the actual semantics of the program and the expectations of the user. As a solid formal basis for stepping, we develop a framework of computations for answer-set programs. For fully supporting different solver languages, we build our framework on an abstract ASP language that is sufficiently general to capture different solver languages. To this end, we make use of abstract constraints as an established abstraction for popular language constructs such as aggregates. Stepping has been implemented in SeaLion, an integrated development environment for ASP. We illustrate stepping using an example scenario and discuss the stepping plugin of SeaLion. Moreover, we elaborate on methodological aspects and the embedding of stepping in the ASP development process.

Includes members:
  Member "the dlvhex system for knowledge representation recent advances system description":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a logic based framework leveraging neural networks for studying the evolution of neurological disorders")
  Member "kara a system for visualising and visual editing of interpretations for answer set programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "onlinesparc a programming environment for answer set programming")
  Member "the sealion has landed an ide for answer set programming preliminary report":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "onlinesparc a programming environment for answer set programming")
  Member "catching the ouroboros on debugging non ground answer set programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "debugging non ground asp programs technique and graphical tools")
  Member "on elementary loops of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "paracoherent answer set semantics meets argumentation frameworks")
  Member "logic programs with propositional connectives and aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an asp semantics for constraints involving conditional aggregates")
  Member "justifications for logic programs under answer set semantics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "debugging non ground asp programs technique and graphical tools")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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.AI(Artificial Intelligence)