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: "mace4 reference manual and guide"
  Abstract: Mace4 is a program that searches for finite models of first-order formulas. For a given domain size, all instances of the formulas over the domain are constructed. The result is a set of ground clauses with equality. Then, a decision procedure based on ground equational rewriting is applied. If satisfiability is detected, one or more models are printed. Mace4 is a useful complement to first-order theorem provers, with the prover searching for proofs and Mace4 looking for countermodels, and it is useful for work on finite algebras. Mace4 performs better on equational problems than did our previous model-searching program Mace2.

Connected through hyperedge HE-1 (induced by source paper "on the expressivity and applicability of model representation formalisms"):
  with members:
    - "decidability of the monadic shallow linear first order fragment with straight dismatching constraints"
    - "first order logic theorem proving and model building via approximation and instantiation"
    - "on first order model based reasoning"

Connected through hyperedge HE-2 (induced by source paper "lewisian fixed points i two incomparable constructions"):
  with members:
    - "lewis meets brouwer constructive strict implication"

Connected through hyperedge HE-3 (induced by source paper "blocking and other enhancements for bottom up model generation methods"):
  with members:
    - "using tableau to decide description logics with full role negation and identity"
    - "automated synthesis of tableau calculi"
    - "semantics of typed lambda calculus with constructors"
    - "decidable reasoning in terminological knowledge representation systems"

Connected through hyperedge HE-4 (induced by source paper "theorem proving in large formal mathematics as an emerging ai field"):
  with members:
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "atp and presentation service for mizar formalizations"
    - "a wiki for mizar motivation considerations and initial prototype"
    - "otter 3 3 reference manual"

Connected through hyperedge HE-5 (induced by source paper "grounding fo and fo id with bounds"):
  with members:
    - "extending classical logic with inductive definitions"
    - "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.SC(Symbolic Computation)