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: "extending the stable model semantics with more expressive rules"
  Abstract: The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an efficient implementation, the new rules supplant the standard ones in practical applications of the stable model semantics.

Connected through hyperedge HE-1 (induced by source paper "on minimal corrections in asp"):
  with members:
    - "complex optimization in answer set programming"
    - "catching the ouroboros on debugging non ground answer set programs"
    - "testing and debugging techniques for answer set solver development"

Connected through hyperedge HE-2 (induced by source paper "expressing preferences using preference set constraint atoms"):
  with members:
    - "planning with preferences using logic programming"
    - "on the expressibility of stable logic programming"
    - "logic programming with ordered disjunction"

Connected through hyperedge HE-3 (induced by source paper "origins of answer set programming some background and two personal accounts"):
  with members:
    - "reiter s default logic is a logic of autoepistemic reasoning and a good one too"
    - "automatic music composition using answer set programming"
    - "testing and debugging techniques for answer set solver development"
    - "modularity aspects of disjunctive stable models"
    - "the dlv system for knowledge representation and reasoning"
    - "a logic for non monotone inductive definitions"
    - "tight logic programs"
    - "on the expressibility of stable logic programming"

Connected through hyperedge HE-4 (induced by source paper "automated verification of weak equivalence within the smodels system"):
  with members:
    - "the dlv system for knowledge representation and reasoning"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "extremal problems in logic programming and stable model computation"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-5 (induced by source paper "diagnostic reasoning with a prolog"):
  with members:
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-6 (induced by source paper "smodels a system for answer set programming"):
  with members:
    - "unfolding partiality and disjunctions in stable model semantics"
    - "des a challenge problem for nonmonotonic reasoning systems"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-7 (induced by source paper "datalog with constraints an answer set programming system"):
  with members:
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-8 (induced by source paper "extending and implementing the stable model semantics"):
  with members:
    - "stable models and an alternative logic programming paradigm"

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)