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 "lazy model expansion interleaving grounding with search"):
  Abstract: Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in some logic. The state-of-the-art approach for bounded model generation for rich knowledge representation languages, like ASP, FO(.) and Zinc, is ground-and-solve: reduce the theory to a ground or propositional one and apply a search algorithm to the resulting theory. #R##N#An important bottleneck is the blowup of the size of the theory caused by the reduction phase. Lazily grounding the theory during search is a way to overcome this bottleneck. We present a theoretical framework and an implementation in the context of the FO(.) knowledge representation language. Instead of grounding all parts of a theory, justifications are derived for some parts of it. Given a partial assignment for the grounded part of the theory and valid justifications for the formulas of the non-grounded part, the justifications provide a recipe to construct a complete assignment that satisfies the non-grounded part. When a justification for a particular formula becomes invalid during search, a new one is derived; if that fails, the formula is split in a part to be grounded and a part that can be justified. #R##N#The theoretical framework captures existing approaches for tackling the grounding bottleneck such as lazy clause generation and grounding-on-the-fly, and presents a generalization of the 2-watched literal scheme. We present an algorithm for lazy model expansion and integrate it in a model generator for FO(ID), a language extending first-order logic with inductive definitions. The algorithm is implemented as part of the state-of-the-art FO(ID) Knowledge-Base System IDP. Experimental results illustrate the power and generality of the approach.

Includes members:
  Member "predicate logic as a modelling language the idp system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi shot asp solving with clingo")
  Member "the third open answer set programming competition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the seventh answer set programming competition design and results")
  Member "short and long supports for constraint propagation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "xcsp3 an integrated format for benchmarking combinatorial constrained problems")
  Member "asp modulo csp the clingcon system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the external interface for extending wasp")
  Member "compiling finite domain constraints to sat with bee":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal depth sorting networks")
  Member "on the implementation of the probabilistic logic programming language problog":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "implementing a library for probabilistic programming using non strict non determinism")
  Member "constraint propagation for first order logic and inductive definitions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3")
  Member "grounding fo and fo id with bounds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fms functional programming as a modelling language")

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)