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: "conformant planning as a case study of incremental qbf solving"
  Abstract: We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incrementally encode a planning instance into a sequence of QBFs. To solve this sequence of successively constructed QBFs, we use our general-purpose incremental QBF solver DepQBF. Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase and in the solving phase. Experimental results show that incremental QBF solving outperforms non-incremental QBF solving. Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.

Connected through hyperedge HE-1 (induced by source paper "expansion based qbf solving without recursion"):
  with members:
    - "evaluating qbf solvers quantifier alternations matter"
    - "on expansion and resolution in cegar based qbf solving"
    - "encodings of bounded synthesis"
    - "depqbf 6 0 a search based qbf solver beyond traditional qcdcl"
    - "structural synthesis for gxw specifications"
    - "detecting unrealizability of distributed fault tolerant systems"

Connected through hyperedge HE-2 (induced by source paper "depqbf 6 0 a search based qbf solver beyond traditional qcdcl"):
  with members:
    - "evaluating qbf solvers quantifier alternations matter"
    - "the qbf gallery"
    - "q resolution with generalized axioms"
    - "incrementally computing minimal unsatisfiable cores of qbfs via a clause group solver api"
    - "incremental qbf solving"
    - "computing resolution path dependencies in linear time"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

Connected through hyperedge HE-3 (induced by source paper "the qbf gallery"):
  with members:
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

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

Connected through hyperedge HE-5 (induced by source paper "automated benchmarking of incremental sat and qbf solvers"):
  with members:
    - "incremental qbf solving"

Connected through hyperedge HE-6 (induced by source paper "incremental qbf solving"):
  with members:
    - "on qbf proofs and preprocessing"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

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)