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: "programming in logic without logic programming"
  Abstract: In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form  if antecedent then consequent  true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving force, and logic programs play only a supporting role. In the canonical model, states, actions, and other events are represented with timestamps. But in the operational semantics (OS), for the sake of efficiency, timestamps are omitted and only the current state is maintained. State transitions are performed reactively by executing actions to make the  consequents  of rules true whenever the  antecedents  become true. This OS is sound, but incomplete. It cannot make reactive rules true by preventing their  antecedents  from becoming true, or by proactively making their  consequents  true before their  antecedents  become true. In this paper, we characterize the notion of reactive model, and prove that the OS can generate all and only such models. In order to focus on the main issues, we omit the logic programming component of the framework.

Connected through hyperedge HE-1 (induced by source paper "using swish to realise interactive web based tutorials for logic based languages"):
  with members:
    - "inference and learning in probabilistic logic programs using weighted boolean formulas"
    - "structure learning of probabilistic logic programs by searching the clause space"
    - "pengines web logic programming made easy"
    - "well definedness and efficient inference for probabilistic logic programming under the distribution semantics"
    - "swi prolog and the web"
    - "pldoc wiki style literate programming for prolog"
    - "extending classical logic with inductive definitions"

Connected through hyperedge HE-2 (induced by source paper "web star a visual web based ide for a story comprehension system"):
  with members:
    - "an online development environment for answer set programming"
    - "the amazing mysteries of the gutter drawing inferences between panels in comic book narratives"
    - "swish swi prolog for sharing"
    - "a web based ide for idp"
    - "prospects for in depth story understanding by computer"

Connected through hyperedge HE-3 (induced by source paper "onlinesparc a programming environment for answer set programming"):
  with members:
    - "visualising interactive inferences with idpd3"
    - "a web based ide for idp"
    - "kara a system for visualising and visual editing of interpretations for answer set programs"
    - "the sealion has landed an ide for answer set programming preliminary report"

Connected through hyperedge HE-4 (induced by source paper "an online development environment for answer set programming"):
  with members:
    - "visualising interactive inferences with idpd3"
    - "a web based ide for idp"
    - "kara a system for visualising and visual editing of interpretations for answer set programs"
    - "the sealion has landed an ide for answer set programming preliminary report"

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)