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 "on the applicability of post s lattice"):
  Abstract: For decision problems P defined over Boolean circuits from a restricted set of gates, we have that P(B) AC0 many-one reduces to P(B') for all finite sets B and B' of gates such that all gates from B can be computed by circuits over gates from B'. In this paper, we show that a weaker version of this statement holds for decision problems defined over Boolean formulae, namely that P(B) NC2 many-one reduces to P(B' union {and,or}) and that P(B) NC2 many-one reduces to P(B' union {false,true}), for all finite sets B and B' of Boolean functions such that all f in B can be defined in B'.

Includes members:
  Member "the complexity of satisfiability for fragments of hybrid logic part i":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterised complexity of abduction in schaefer s framework")
  Member "the complexity of reasoning for fragments of autoepistemic logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized complexity of alc subsumption")
  Member "the complexity of propositional implication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strong backdoors for default logic")
  Member "the complexity of reasoning for fragments of default logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized complexity of alc subsumption")
  Member "generalized modal satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quirky quantifiers optimal models and complexity of computation tree logic")
  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 "the tractability of model checking for ltl the good the bad and the ugly fragments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parameterised complexity of abduction in schaefer s framework")

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.CC(Computational Complexity)