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 "backdoors to normality for disjunctive logic programs"):
  Abstract: Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim of this paper is to investigate theoretically how Sat can be utilized for the efficient solution of problems that are harder than NP or co-NP. In particular, we consider the fundamental reasoning problems in propositional disjunctive answer set programming (ASP), Brave Reasoning and Skeptical Reasoning, which ask whether a given atom is contained in at least one or in all answer sets, respectively. Both problems are located at the second level of the Polynomial Hierarchy and thus assumed to be harder than NP or co-NP. One cannot transform these two reasoning problems into SAT in polynomial time, unless the Polynomial Hierarchy collapses. We show that certain structural aspects of disjunctive logic programs can be utilized to break through this complexity barrier, using new techniques from Parameterized Complexity. In particular, we exhibit transformations from Brave and Skeptical Reasoning to SAT that run in time O(2^k n^2) where k is a structural parameter of the instance and n the input size. In other words, the reduction is fixed-parameter tractable for parameter k. As the parameter k we take the size of a smallest backdoor with respect to the class of normal (i.e., disjunction-free) programs. Such a backdoor is a set of atoms that when deleted makes the program normal. In consequence, the combinatorial explosion, which is expected when transforming a problem from the second level of the Polynomial Hierarchy to the first level, can now be confined to the parameter k, while the running time of the reduction is polynomial in the input size n, where the order of the polynomial is independent of k.

Includes members:
  Member "dual normal logic programs the forgotten class":
    also connected through other hyperedges:
      (none)
  Member "the third open answer set programming competition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the seventh answer set programming competition design and results")
  Member "the parameterized complexity of reasoning problems beyond np":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "results in workflow resiliency complexity new formulation and asp encoding")
  Member "backdoors to abduction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "backdoors into heterogeneous classes of sat and csp")
  Member "the good the bad and the odd cycles in answer set programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "backdoors to tractable answer set programming")
  Member "backdoors to satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hunting for tractable languages for judgment aggregation")
  Member "backdoors to tractable answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "structural decompositions of epistemic logic programs")
  Member "detecting inconsistencies in large biological networks with answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a logic based framework leveraging neural networks for studying the evolution of neurological disorders")

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.LO(Logic in Computer Science)