human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "syntax preserving belief change operators for logic programs"):
  Abstract: Recent methods have adapted the well-established AGM and belief base frameworks for belief change to cover belief revision in logic programs. In this study here, we present two new sets of belief change operators for logic programs. They focus on preserving the explicit relationships expressed in the rules of a program, a feature that is missing in purely semantic approaches that consider programs only in their entirety. In particular, operators of the latter class fail to satisfy preservation and support, two important properties for belief change in logic programs required to ensure intuitive results. #R##N#We address this shortcoming of existing approaches by introducing partial meet and ensconcement constructions for logic program belief change, which allow us to define syntax-preserving operators that satisfy preservation and support. Our work is novel in that our constructions not only preserve more information from a logic program during a change operation than existing ones, but they also facilitate natural definitions of contraction operators, the first in the field to the best of our knowledge. #R##N#In order to evaluate the rationality of our operators, we translate the revision and contraction postulates from the AGM and belief base frameworks to the logic programming setting. We show that our operators fully comply with the belief base framework and formally state the interdefinability between our operators. We further propose an algorithm that is based on modularising a logic program to reduce partial meet and ensconcement revisions or contractions to performing the operation only on the relevant modules of that program. Finally, we compare our approach to two state-of-the-art logic program revision methods and demonstrate that our operators address the shortcomings of one and generalise the other method.

Includes members:
  Member "characterization of logic program revision as an extension of propositional revision":
    also connected through other hyperedges:
      (none)
  Member "the rise and fall of semantic rule updates based on se models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exception based knowledge updates")
  Member "a program level approach to revising logic programs under the answer set semantics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the rise and fall of semantic rule updates based on se models")
  Member "updates in answer set programming an approach based on basic structural properties":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exception based knowledge updates")
  Member "strong equivalence made easy nested expressions and weight constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on uniform equivalence of epistemic logic programs")
  Member "a semantic framework for preference handling in answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a family of descriptive approaches to preferred answer sets")
  Member "a framework for compiling preferences in logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a logic framework for p2p deductive databases")
  Member "on properties of update sequences based on causal rejection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "belief base revision for further improvement of unified answer set programming")

Question: Please tell me which class the source paper 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)