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: "a scalable algorithm for minimal unsatisfiable core extraction"
  Abstract: We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds smaller cores than suboptimal algorithms; and that it runs faster than those algorithms that guarantee minimality of the core.

Connected through hyperedge HE-1 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof"):
  with members:
    - "are query based ontology debuggers really helping knowledge engineers"
    - "a generally applicable highly scalable measurement computation and optimization approach to sequential model based diagnosis"
    - "inexpensive cost optimized measurement proposal for sequential model based diagnosis"
    - "towards better response times and higher quality queries in interactive knowledge base debugging"
    - "interactive debugging of knowledge bases"
    - "rio minimizing user interaction in ontology debugging"
    - "interactive ontology debugging two query strategies for efficient fault localization"

Connected through hyperedge HE-2 (induced by source paper "conquering the extensional scalability problem for value flow analysis frameworks"):
  with members:
    - "efficient generation of craig interpolants in satisfiability modulo theories"

Connected through hyperedge HE-3 (induced by source paper "a linear algebra formulation for boolean satisfiability testing"):
  with members:
    - "the p versus np problem"
    - "a new look at survey propagation and its generalizations"

Connected through hyperedge HE-4 (induced by source paper "incrementally computing minimal unsatisfiable cores of qbfs via a clause group solver api"):
  with members:
    - "conformant planning as a case study of incremental qbf solving"
    - "incremental qbf solving"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

Connected through hyperedge HE-5 (induced by source paper "resolution proof transformation for compression and interpolation"):
  with members:
    - "proof tree preserving interpolation"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-6 (induced by source paper "detecting inconsistencies in large biological networks with answer set programming"):
  with members:
    - "the dlv system for knowledge representation and reasoning"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

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