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 linear temporal logic"):
  Abstract: In the present paper we introduce the notion of strong backdoors into the field of temporal logic for the CNF-fragment of linear temporal logic introduced by Fisher. We study the parameterised complexity of the satisfiability problem parameterised by the size of the backdoor. We distinguish between backdoor detection and evaluation of backdoors into the fragments of horn and krom formulas. Here we classify the operator fragments of globally-operators for past or future, and the combination of both. Detection is shown to be in FPT whereas the complexity of evaluation behaves different. We show that for krom formulas the problem is paraNP-complete. For horn formulas the complexity is shown to be either fixed parameter tractable or paraNP-complete depending on the considered operator fragment.

Includes members:
  Member "ltl fragments are hard for standard parameterisations":
    also connected through other hyperedges:
      (none)
  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 "the complexity of clausal fragments of ltl":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "horn fragments of the halpern shoham interval temporal logic")
  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 generalized satisfiability for linear temporal logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterised complexity of abduction in schaefer s framework")
  Member "clausal temporal resolution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timeline based planning expressiveness and complexity")

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)