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: "nonmonotonic logics and semantics"
  Abstract: Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may be deduced from a set A of formulas iff a holds in all of the "preferred" models in which all the elements of A hold. Shoham proposed that the notion of "preferred" models be defined by a partial ordering on the models of the underlying language. A more general semantics is described in this paper, based on a set of natural properties of choice functions. This semantics is here shown to be equivalent to a semantics based on comparing the relative "importance" of sets of models, by what amounts to a qualitative probability measure. The consequence operations defined by the equivalent semantics are then characterized by a weakening of Tarski's properties in which the monotonicity requirement is replaced by three weaker conditions. Classical propositional connectives are characterized by natural introduction-elimination rules in a nonmonotonic setting. Even in the nonmonotonic setting, one obtains classical propositional logic, thus showing that monotonicity is not required to justify classical propositional connectives.

Connected through hyperedge HE-1 (induced by source paper "revealed preferences for matching with contracts"):
  with members:
    - "combinatorial auctions with decreasing marginal utilities"
    - "nonmonotonic reasoning preferential models and cumulative logics"

Connected through hyperedge HE-2 (induced by source paper "pivotal and pivotal discriminative consequence relations"):
  with members:
    - "preferential and preferential discriminative consequence relations"
    - "what does a conditional knowledge base entail"
    - "nonmonotonic reasoning preferential models and cumulative logics"
    - "connectives in quantum and other cumulative logics"

Connected through hyperedge HE-3 (induced by source paper "preferential and preferential discriminative consequence relations"):
  with members:
    - "what does a conditional knowledge base entail"
    - "nonmonotonic reasoning preferential models and cumulative logics"
    - "connectives in quantum and other cumulative logics"

Connected through hyperedge HE-4 (induced by source paper "the logical meaning of expansion"):
  with members:
    - "nonmonotonic reasoning preferential models and cumulative logics"

Connected through hyperedge HE-5 (induced by source paper "connectives in quantum and other cumulative logics"):
  with members:
    - "nonmonotonic reasoning preferential models and cumulative 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.AI(Artificial Intelligence)