human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "complexity of propositional abduction for restricted sets of boolean functions"
  Abstract: Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional abduction, where the knowledge base and the manifestation are represented by propositional formulae. The problem of deciding whether there exists an explanation has been shown to be SigmaP2-complete in general. We consider variants obtained by restricting the allowed connectives in the formulae to certain sets of Boolean functions. We give a complete classification of the complexity for all considerable sets of Boolean functions. In this way, we identify easier cases, namely NP-complete and polynomial cases; and we highlight sources of intractability. Further, we address the problem of counting the explanations and draw a complete picture for the counting complexity.

Connected through hyperedge HE-1 (induced by source paper "parameterised complexity of abduction in schaefer s framework"):
  with members:
    - "parameterised complexity for abduction"
    - "analysis of boolean functions"
    - "parameterized exact and approximation algorithms for maximum k set cover and related satisfiability problems"
    - "paradigms for parameterized enumeration"
    - "generalized satisfiability for the description logic alc"
    - "the complexity of satisfiability for fragments of hybrid logic part i"
    - "complexity classifications for propositional abduction in post s framework"
    - "the complexity of generalized satisfiability for linear temporal logic"

Connected through hyperedge HE-2 (induced by source paper "on the complexity of second best abductive explanations"):
  with members:
    - "complexity classifications for propositional abduction in post s framework"

Connected through hyperedge HE-3 (induced by source paper "the complexity of reasoning for fragments of autoepistemic logic"):
  with members:
    - "the complexity of propositional implication"
    - "the complexity of reasoning for fragments of default logic"
    - "the tractability of model checking for ltl the good the bad and the ugly fragments"

Connected through hyperedge HE-4 (induced by source paper "complexity of non monotonic logics"):
  with members:
    - "the complexity of reasoning for fragments of autoepistemic logic"
    - "the complexity of propositional implication"
    - "the complexity of reasoning for fragments of default logic"

Question: Please tell me which class the center node 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)