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 "knowledge compilation for boolean functional synthesis"):
  Abstract: Given a Boolean formula F(X,Y), where X is a vector of outputs and Y is a vector of inputs, the Boolean functional synthesis problem requires us to compute a Skolem function vector G(Y)for X such that F(G(Y),Y) holds whenever \exists X F(X,Y) holds. In this paper, we investigate the relation between the representation of the specification F(X,Y) and the complexity of synthesis. We introduce a new normal form for Boolean formulas, called SynNNF, that guarantees polynomial-time synthesis and also polynomial-time existential quantification for some order of quantification of variables. We show that several normal forms studied in the knowledge compilation literature are subsumed by SynNNF, although SynNNFcan be super-polynomially more succinct than them. Motivated by these results, we propose an algorithm to convert a specification in CNF to SynNNF, with the intent of solving the Boolean functional synthesis problem. Experiments with a prototype implementation show that this approach solves several benchmarks beyond the reach of state-of-the-art tools.

Includes members:
  Member "understanding and extending incremental determinization for 2qbf":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning heuristics for quantified boolean formulas through deep reinforcement learning")
  Member "what s hard about boolean functional synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "functional synthesis via input output separation")
  Member "functional synthesis via input output separation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sequential relational decomposition")
  Member "towards parallel boolean functional synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "functional synthesis via input output separation")
  Member "skolem functions for factored formulas":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "functional synthesis via input output separation")
  Member "propositional independence formula variable independence and forgetting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the reasons behind decisions")
  Member "a knowledge compilation map":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "abstracting probabilistic models a logical perspective")

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)