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: "a sequent calculus and a theorem prover for standard conditional logics"
  Abstract: In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space complexity bounds for the respective logics. We also present CondLean, a theorem prover for these logics implementing SeqS calculi written in SICStus Prolog.

Connected through hyperedge HE-1 (induced by source paper "quantified conditional logics are fragments of hol"):
  with members:
    - "embedding and automating conditional logics in classical higher order logic"

Connected through hyperedge HE-2 (induced by source paper "completeness of flat coalgebraic fixpoint logics"):
  with members:
    - "exptime tableaux for the coalgebraic mu calculus"
    - "flat coalgebraic fixed point logics"
    - "pspace bounds for rank 1 modal logics"
    - "completeness for flat modal fixpoint logics"

Connected through hyperedge HE-3 (induced by source paper "generic modal cut elimination applied to conditional logics"):
  with members:
    - "pspace bounds for rank 1 modal logics"
    - "nonmonotonic reasoning preferential models and cumulative logics"

Connected through hyperedge HE-4 (induced by source paper "the craft of model making pspace bounds for non iterative modal logics"):
  with members:
    - "reasoning about expectation"
    - "a logic for reasoning about upper probabilities"
    - "pspace reasoning for graded modal logics"

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)