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 "using methods of declarative logic programming for intelligent information agents"):
  Abstract: The search for information on the web is faced with several problems, which arise on the one hand from the vast number of available sources, and on the other hand from their heterogeneity. A promising approach is the use of multi-agent systems of information agents, which cooperatively solve advanced information-retrieval problems. This requires capabilities to address complex tasks, such as search and assessment of sources, query planning, information merging and fusion, dealing with incomplete information, and handling of inconsistency. In this paper, our interest is in the role which some methods from the field of declarative logic programming can play in the realization of reasoning capabilities for information agents. In particular, we are interested in how they can be used and further developed for the specific needs of this application domain. We review some existing systems and current projects, which address information-integration problems. We then focus on declarative knowledge-representation methods, and review and evaluate approaches from logic programming and nonmonotonic reasoning for information agents. We discuss advantages and drawbacks, and point out possible extensions and open issues.

Includes members:
  Member "disjunctive logic programs with inheritance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "characterizing and extending answer set semantics using possibility theory")
  Member "information integration and computational logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a knowledge based approach for selecting information sources")
  Member "logic programs with compiled preferences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "preferred answer sets for ordered logic programs")
  Member "a compiler for ordered logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a framework for compiling preferences in logic programs")
  Member "declarative representation of revision strategies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reasoning about evolving nonmonotonic knowledge bases")
  Member "probabilistic agent programs":
    also connected through other hyperedges:
      (none)
  Member "well founded semantics for extended logic programs with dynamic preferences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a family of descriptive approaches to preferred answer sets")

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.MA(Multiagent Systems)