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 "logic control on program construction and verification"):
  Abstract: This paper presents an example of formal reasoning about the semantics of a Prolog program of practical importance (the SAT solver of Howe and King). The program is treated as a definite clause logic program with added control. The logic program is constructed by means of stepwise refinement, hand in hand with its correctness and completeness proofs. The proofs are declarative - they do not refer to any operational semantics. Each step of the logic program construction follows a systematic approach to constructing programs which are provably correct and complete. We also prove that correctness and completeness of the logic program is preserved in the final Prolog program. Additionally, we prove termination, occur-check freedom and non-floundering. #R##N#Our example shows how dealing with "logic" and with "control" can be separated. Most of the proofs can be done at the "logic" level, abstracting from any operational semantics. #R##N#The example employs approximate specifications; they are crucial in simplifying reasoning about logic programs. It also shows that the paradigm of semantics-preserving program transformations may be not sufficient. We suggest considering transformations which preserve correctness and completeness with respect to an approximate specification.

Includes members:
  Member "proving completeness of logic programs with the cut":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the prolog debugger and declarative programming")
  Member "on definite program answers and least herbrand models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proving completeness of logic programs with the cut")
  Member "correctness and completeness of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the prolog debugger and declarative programming examples")
  Member "on completeness of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proving completeness of logic programs with the cut")
  Member "sicstus prolog the first 25 years":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constraint answer set solver ezcsp and why integration schemas matter")
  Member "polytool polynomial interpretations as a basis for termination analysis of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "correctness and completeness of logic programs")
  Member "proving correctness and completeness of normal programs a declarative approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on correctness of an n queens program")
  Member "classes of terminating logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "contextual hypotheses and semantics of logic programs")

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)