human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "minimum model semantics for logic programs with negation as failure"
  Abstract: We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics the meaning of a program is, as in the classical case, the unique minimum model in a program-independent ordering. We use an expanded truth domain that has an uncountable linearly ordered set of truth values between False (the minimum element) and True (the maximum), with a Zero element in the middle. The truth values below Zero are ordered like the countable ordinals. The values above Zero have exactly the reverse order. Negation is interpreted as reflection about Zero followed by a step towards Zero; the only truth value that remains unaffected by negation is Zero. We show that every program has a unique minimum model M_P, and that this model can be constructed with a T_P iteration which proceeds through the countable ordinals. Furthermore, we demonstrate that M_P can also be obtained through a model intersection construction which generalizes the well-known model intersection theorem for classical logic programming. Finally, we show that by collapsing the true and false values of the infinite-valued model M_P to (the classical) True and False, we obtain a three-valued model identical to the well-founded one.

Connected through hyperedge HE-1 (induced by source paper "extensional semantics for higher order logic programs with negation"):
  with members:
    - "an analysis of the equational properties of the well founded fixed point"
    - "equivalence of two fixed point semantics for definitional higher order logic programs"
    - "minimum model semantics for extensional higher order logic programming with negation"
    - "extensional higher order logic programming"

Connected through hyperedge HE-2 (induced by source paper "an analysis of the equational properties of the well founded fixed point"):
  with members:
    - "a representation theorem for stratified complete lattices"
    - "a fixed point theorem for non monotonic functions"
    - "minimum model semantics for extensional higher order logic programming with negation"
    - "modularity aspects of disjunctive stable models"
    - "splitting an operator algebraic modularity results for logics with fixpoint semantics"

Connected through hyperedge HE-3 (induced by source paper "a representation theorem for stratified complete lattices"):
  with members:
    - "a fixed point theorem for non monotonic functions"
    - "minimum model semantics for extensional higher order logic programming with negation"

Connected through hyperedge HE-4 (induced by source paper "a fixed point theorem for non monotonic functions"):
  with members:
    - "minimum model semantics for extensional higher order logic programming with negation"
    - "extensional higher order logic programming"
    - "splitting an operator algebraic modularity results for logics with fixpoint semantics"

Connected through hyperedge HE-5 (induced by source paper "minimum model semantics for extensional higher order logic programming with negation"):
  with members:
    - "a fixed point theorem for non monotonic functions"
    - "extensional higher order logic programming"
    - "linear logic based analysis of constraint handling rules with disjunction"

Question: Please tell me which class the center node 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)