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 "depqbf 6 0 a search based qbf solver beyond traditional qcdcl"):
  Abstract: We present the latest version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven clause learning (CDCL) paradigm implemented in state of the art propositional satisfiability (SAT) solvers. The Q-resolution calculus (QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce QRES proofs of QBFs in prenex conjunctive normal form (PCNF) as a byproduct of the solving process. In contrast to traditional QCDCL based on QRES, DepQBF 6.0 implements a variant of QCDCL which is based on a generalization of QRES. This generalization is due to a set of additional axioms and leaves the original Q-resolution rules unchanged. The generalization of QRES enables QCDCL to potentially produce exponentially shorter proofs than traditional QCDCL. We present an overview of the features implemented in DepQBF and report on experimental results which demonstrate the effectiveness of generalized QRES in QCDCL.

Includes members:
  Member "evaluating qbf solvers quantifier alternations matter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "te eth lower bounds for qbfs of bounded treewidth")
  Member "the qbf gallery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "q resolution with generalized axioms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph neural reasoning may fail in certifying boolean unsatisfiability")
  Member "incrementally computing minimal unsatisfiable cores of qbfs via a clause group solver api":
    also connected through other hyperedges:
      (none)
  Member "conformant planning as a case study of incremental qbf solving":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "expansion based qbf solving without recursion")
  Member "incremental qbf solving":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "satisfiability based methods for reactive synthesis from safety specifications")
  Member "computing resolution path dependencies in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond q resolution and prenex form a proof system for quantified constraint satisfaction")
  Member "clause term resolution and learning in the evaluation of quantified boolean formulas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")

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)