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 "clausal abstraction for dqbf full version"):
  Abstract: Dependency quantified Boolean formulas (DQBF) is a logic admitting existential quantification over Boolean functions, which allows us to elegantly state synthesis problems in verification such as the search for invariants, programs, or winning regions of games. In this paper, we lift the clausal abstraction algorithm for quantified Boolean formulas (QBF) to DQBF. Clausal abstraction for QBF is an abstraction refinement algorithm that operates on a sequence of abstractions that represent the different quantifier levels. For DQBF we need to generalize this principle to partial orders of abstractions. The two challenges to overcome are: (1) Clauses may contain literals with incomparable dependencies, which we address by the recently proposed proof rule called Fork Extension, and (2) existential variables may have spurious dependencies, which we prevent by tracking consistency requirements during the execution. Our implementation dCAQE solves significantly more formulas than the existing DQBF algorithms.

Includes members:
  Member "synthesizing reactive systems from hyperproperties":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constraint based monitoring of hyperproperties")
  Member "bosy an experimentation framework for bounded synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "encodings of bounded synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fbsat automatic inference of minimal finite state models of function blocks using sat solver")
  Member "solving qbf by abstraction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bosy an experimentation framework for bounded synthesis")
  Member "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  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")

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)