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: "composition with target constraints"
  Abstract: It is known that the composition of schema mappings, each specified by#N#source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO#N#tgd). We consider the question of what happens when target constraints are#N#allowed. Specifically, we consider the question of specifying the composition#N#of standard schema mappings (those specified by st-tgds, target egds, and a#N#weakly acyclic set of target tgds). We show that SO tgds, even with the#N#assistance of arbitrary source constraints and target constraints, cannot#N#specify in general the composition of two standard schema mappings. Therefore,#N#we introduce source-to-target second-order dependencies (st-SO dependencies),#N#which are similar to SO tgds, but allow equations in the conclusion. We show#N#that st-SO dependencies (along with target egds and target tgds) are sufficient#N#to express the composition of every finite sequence of standard schema#N#mappings, and further, every st-SO dependency specifies such a composition. In#N#addition to this expressive power, we show that st-SO dependencies enjoy other#N#desirable properties. In particular, they have a polynomial-time chase that#N#generates a universal solution. This universal solution can be used to find the#N#certain answers to unions of conjunctive queries in polynomial time. It is easy#N#to show that the composition of an arbitrary number of standard schema mappings#N#is equivalent to the composition of only two standard schema mappings. We show#N#that surprisingly, the analogous result holds also for schema mappings#N#specified by just st-tgds (no target constraints). This is proven by showing#N#that every SO tgd is equivalent to an unnested SO tgd (one where there is no#N#nesting of function symbols). Similarly, we prove unnesting results for st-SO#N#dependencies, with the same types of consequences.

Connected through hyperedge HE-1 (induced by source paper "exchange repairs managing inconsistency in data exchange"):
  with members:
    - "resolution and datalog rewriting under value invention and equality constraints"
    - "the dlv system for knowledge representation and reasoning"
    - "minimal change integrity maintenance using tuple deletions"

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.DB(Databases)