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 "constraint propagation for first order logic and inductive definitions"):
  Abstract: Constraint propagation is one of the basic forms of inference in many logic-based reasoning systems. In this paper, we investigate constraint propagation for first-order logic (FO), a suitable language to express a wide variety of constraints. We present an algorithm with polynomial-time data complexity for constraint propagation in the context of an FO theory and a finite structure. We show that constraint propagation in this manner can be represented by a datalog program and that the algorithm can be executed symbolically, i.e., independently of a structure. Next, we extend the algorithm to FO(ID), the extension of FO with inductive definitions. Finally, we discuss several applications.

Includes members:
  Member "lifted unit propagation for effective grounding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "model revision inference for extensions of first order logic")
  Member "grounding fo and fo id with bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fms functional programming as a modelling language")
  Member "fo fd extending classical logic with rule based fixpoint definitions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a restricted second order logic for non deterministic poly logarithmic time")
  Member "design and implementation of aggregate functions in the dlv system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "shared aggregate sets in answer set programming")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the seventh answer set programming competition design and results")
  Member "well founded and stable semantics of logic programs with aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "selp a single shot epistemic logic program solver")
  Member "propositional satisfiability in answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the dlv system for knowledge representation and reasoning")
  Member "extending classical logic with inductive definitions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the informal semantics of answer set programming a tarskian 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)