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: "transformation based bottom up computation of the well founded model"
  Abstract: We present a framework for expressing bottom-up algorithms to compute the well-founded model of non-disjunctive logic programs. Our method is based on the notion of conditional facts and elementary program transformations studied by Brass and Dix for disjunctive programs. However, even if we restrict their framework to nondisjunctive programs, their residual program can grow to exponential size, whereas for function-free programs our program remainder is always polynomial in the size of the extensional database (EDB). #R##N#We show that particular orderings of our transformations (we call them strategies) correspond to well-known computational methods like the alternating fixpoint approach, the well-founded magic sets method and the magic alternating fixpoint procedure. However, due to the confluence of our calculi, we come up with computations of the well-founded model that are provably better than these methods. #R##N#In contrast to other approaches, our transformation method treats magic set transformed programs correctly, i.e. it always computes a relevant part of the well-founded model of the original program.

Connected through hyperedge HE-1 (induced by source paper "about epistemic negation and world views in epistemic logic programs"):
  with members:
    - "splitting epistemic logic programs"
    - "query answering in resource based answer set semantics"
    - "revisiting epistemic specifications"
    - "xsb extending prolog with tabled logic programming"
    - "normal forms for answer sets programming"
    - "on the existence of stable models of non stratified logic programs"
    - "extremal problems in logic programming and stable model computation"

Connected through hyperedge HE-2 (induced by source paper "extended magic for negation efficient demand driven evaluation of stratified datalog with precise complexity guarantees"):
  with members:
    - "applp a dialogue on applications of logic programming"

Connected through hyperedge HE-3 (induced by source paper "properties of stable model semantics extensions"):
  with members:
    - "each normal logic program has a 2 valued minimal hypotheses semantics"

Connected through hyperedge HE-4 (induced by source paper "efficient computation of the well founded semantics over big data"):
  with members:
    - "parallel instantiation of asp programs techniques and experiments"

Connected through hyperedge HE-5 (induced by source paper "win move is coordination free sometimes"):
  with members:
    - "relational transducers for declarative networking"

Connected through hyperedge HE-6 (induced by source paper "each normal logic program has a 2 valued minimal hypotheses semantics"):
  with members:
    - "logic programming with ordered disjunction"

Connected through hyperedge HE-7 (induced by source paper "justifications for logic programs under answer set semantics"):
  with members:
    - "temporal phylogenetic networks and logic programming"
    - "graphs and colorings for answer set programming"
    - "bounded ltl model checking with stable models"
    - "diagnostic reasoning with a prolog"
    - "a framework for compiling preferences in logic programs"
    - "assertion checker for the c programming language based on computations over event traces"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-8 (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"
    - "on the problem of computing the well founded semantics"
    - "slt resolution for the well founded semantics"
    - "linear tabulated resolution based on prolog control strategy"

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)