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 "expansion based qbf solving without recursion"):
  Abstract: In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifiers over Boolean variables. Such approaches partially expand one type of variable (either existential or universal) and pass the obtained formula to a SAT solver for deciding the QBF. State-of-the-art expansion-based solvers process the given formula quantifier-block wise and recursively apply expansion until a solution is found. #R##N#In this paper, we present a novel algorithm for expansion-based QBF solving that deals with the whole quantifier prefix at once. Hence recursive applications of the expansion principle are avoided. Experiments indicate that the performance of our simple approach is comparable with the state of the art of QBF solving, especially in combination with other solving techniques.

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 "on expansion and resolution in cegar based qbf solving":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "encodings of bounded synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fbsat automatic inference of minimal finite state models of function blocks using sat solver")
  Member "depqbf 6 0 a search based qbf solver beyond traditional qcdcl":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "structural synthesis for gxw specifications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "detecting unrealizability of distributed fault tolerant systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "conformant planning as a case study of incremental qbf solving":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "depqbf 6 0 a search based qbf solver beyond traditional qcdcl")

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)