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: "local termination theory and practice"
  Abstract: The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years. Both the semantic characterisation and most known termination methods are concerned with global termination, uniformly of all the terms of a term rewriting system (TRS). In this paper we consider local termination, of specific sets of terms within a given TRS. The principal goal of this paper is generalising the semantic characterisation of global termination to local termination. This is made possible by admitting the well-founded monotone algebras to be partial. We also extend our approach to local relative termination. The interest in local termination naturally arises in program verification, where one is probably interested only in sensible inputs, or just wants to characterise the set of inputs for which a program terminates. Local termination will be also be of interest when dealing with a specific class of terms within a TRS that is known to be non-terminating, such as combinatory logic (CL) or a TRS encoding recursive program schemes or Turing machines. We show how some of the well-known techniques for proving global termination, such as stepwise removal of rewrite rules and semantic labelling, can be adapted to the local case. We also describe transformations reducing local to global termination problems. The resulting techniques for proving local termination have in some cases already been automated. One of our applications concerns the characterisation of the terminating S-terms in CL as regular language. Previously this language had already been found via a tedious analysis of the reduction behaviour of S-terms. These findings have now been vindicated by a fully automated and verified proof.

Connected through hyperedge HE-1 (induced by source paper "sparse tiling through overlap closures for termination of string rewriting"):
  with members:
    - "efficient completion of weighted automata"

Connected through hyperedge HE-2 (induced by source paper "star games and hydras"):
  with members:
    - "complexity of fractran and productivity"

Connected through hyperedge HE-3 (induced by source paper "towards a constraint solver for proving confluence with invariant and equivalence of realistic chr programs"):
  with members:
    - "confluence modulo equivalence with invariants in constraint handling rules"
    - "on proving confluence modulo equivalence for constraint handling rules"

Connected through hyperedge HE-4 (induced by source paper "coinductive foundations of infinitary rewriting and infinitary equational logic"):
  with members:
    - "complexity of fractran and productivity"

Connected through hyperedge HE-5 (induced by source paper "a coinductive framework for infinitary rewriting and equational reasoning extended version"):
  with members:
    - "coinductive techniques in infinitary lambda calculus"
    - "infinitary term rewriting for weakly orthogonal systems properties and counterexamples"
    - "a coinductive treatment of infinitary rewriting"
    - "complexity of fractran and productivity"

Connected through hyperedge HE-6 (induced by source paper "proving looping and non looping non termination by finite automata"):
  with members:
    - "on the complexity of equivalence of specifications of infinite objects"
    - "transforming outermost into context sensitive rewriting"

Connected through hyperedge HE-7 (induced by source paper "non termination using regular languages"):
  with members:
    - "transforming outermost into context sensitive rewriting"

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)