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: "on the problem of computing the well founded semantics"
  Abstract: The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P)) steps, where size(P) denotes the total number of occurrences of atoms in a logic program P. This bound is achieved by an algorithm introduced by Van Gelder and known as the alternating-fixpoint algorithm. Improving on the alternating-fixpoint algorithm turned out to be difficult. In this paper we study extensions and modifications of the alternating-fixpoint approach. We then restrict our attention to the class of programs whose rules have no more than one positive occurrence of an atom in their bodies. For programs in that class we propose a new implementation of the alternating-fixpoint method in which false atoms are computed in a top-down fashion. We show that our algorithm is faster than other known algorithms and that for a wide class of programs it is linear and so, asymptotically optimal.

Connected through hyperedge HE-1 (induced by source paper "a logic framework for p2p deductive databases"):
  with members:
    - "consistency and trust in peer data exchange systems"
    - "distributed reasoning in a peer to peer setting application to the semantic web"
    - "query answering in peer to peer data exchange systems"
    - "a framework for compiling preferences in logic programs"

Connected through hyperedge HE-2 (induced by source paper "enhancing global sls resolution with loop cutting and tabling mechanisms"):
  with members:
    - "a dynamic approach to characterizing termination of general logic programs"
    - "slt resolution for the well founded semantics"
    - "linear tabulated resolution based on prolog control strategy"
    - "transformation based bottom up computation of the well founded model"

Connected through hyperedge HE-3 (induced by source paper "graphs and colorings for answer set programming"):
  with members:
    - "the dlv system for knowledge representation and reasoning"
    - "normal forms for answer sets programming"
    - "transformation based bottom up computation of the well founded model"

Connected through hyperedge HE-4 (induced by source paper "computing stable models worst case performance estimates"):
  with members:
    - "fixed parameter complexity of semantics for logic programs"
    - "computing large and small stable models"
    - "dlv a system for declarative problem solving"
    - "extremal problems in logic programming and stable model computation"

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)