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 "ursa a system for uniform reduction to sat"):
  Abstract: There are a huge number of problems, from various areas, being solved by#N#reducing them to SAT. However, for many applications, translation into SAT is#N#performed by specialized, problem-specific tools. In this paper we describe a#N#new system for uniform solving of a wide class of problems by reducing them to#N#SAT. The system uses a new specification language URSA that combines imperative#N#and declarative programming paradigms. The reduction to SAT is defined#N#precisely by the semantics of the specification language. The domain of the#N#approach is wide (e.g., many NP-complete problems can be simply specified and#N#then solved by the system) and there are problems easily solvable by the#N#proposed system, while they can be hardly solved by using other programming#N#languages or constraint programming systems. So, the system can be seen not#N#only as a tool for solving problems by reducing them to SAT, but also as a#N#general-purpose constraint solving system (for finite domains). In this paper,#N#we also describe an open-source implementation of the described approach. The#N#performed experiments suggest that the system is competitive to#N#state-of-the-art related modelling systems.

Includes members:
  Member "xml representation of constraint networks format xcsp 2 1":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "message passing and combinatorial optimization")
  Member "satzilla portfolio based algorithm selection for sat":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the seventh answer set programming competition design and results")

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)