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 "strong backdoors for default logic"):
  Abstract: In this paper, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised by the solution size) as well as backdoor evaluation (parameterised by the size of the given backdoor), for various kinds of target classes (cnf, horn, krom, monotone, identity). We show that backdoor detection is fixed-parameter tractable for the considered target classes, and backdoor evaluation is either fixed-parameter tractable, in para-DP2 , or in para-NP, depending on the target class.

Includes members:
  Member "backdoors to normality for disjunctive logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "backdoors to tractable valued csp")
  Member "satisfiability of acyclic and almost acyclic cnf formulas":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity and approximability of parameterized max csps")
  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 "backdoors to satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "structural decompositions of epistemic logic programs")
  Member "the complexity of propositional implication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the weight in enumeration")

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)