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 "symmetry breaking answer set solving"):
  Abstract: In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact.

Includes members:
  Member "practical graph isomorphism ii":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "a translational approach to constraint answer set solving":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sat vs csp a commentary")
  Member "breaking generator symmetry":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "symmetry breaking for distributed multi context systems")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the seventh answer set programming competition design and results")
  Member "weight constraints as nested expressions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "strong equivalence and program s structure in arguing essential equivalence between logic programs")
  Member "tight logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a formal framework for robot construction problems a hybrid planning approach")
  Member "bounded ltl model checking with stable models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reasoning about actions with temporal answer sets")

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)