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 "solving qbf by abstraction"):
  Abstract: Many verification and synthesis approaches rely on solving techniques for quantified Boolean formulas (QBF). Consequently, solution witnesses, in the form of Boolean functions, become more and more important as they represent implementations or counterexamples. We present a recursive counterexample guided abstraction and refinement algorithm (CEGAR) for solving and certifying QBFs that exploits structural reasoning on the formula level. The algorithm decomposes the given QBF into one propositional formula for every block of quantifiers that abstracts from assignments of variables not bound by this quantifier block. Further, we show how to derive an efficient certification extraction method on top of the algorithm. We report on experimental evaluation of this algorithm in the solver QuAbS (Quantified Abstraction Solver) which won the most recent QBF competition (QBFEVAL'18). Further, we show the effectiveness of the certification approach using synthesis benchmarks and a case study for synthesizing winning strategies in Petri Games.

Includes members:
  Member "bosy an experimentation framework for bounded synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fbsat automatic inference of minimal finite state models of function blocks using sat solver")
  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 "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "symbolic vs bounded synthesis for petri games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "translating asynchronous games for distributed synthesis full version")
  Member "the first reactive synthesis competition syntcomp 2014":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "logics for word transductions with synthesis")
  Member "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "practical synthesis of reactive systems from ltl specifications via parity games")
  Member "detecting unrealizability of distributed fault tolerant systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")

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)