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: "handling conflicts in depth first search for ltl tableau to debug compliance based languages"
  Abstract: Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract-based or service-based systems. In this paper, we investigate the problem of extracting temporal unsatisfiable cores in order to detect the inconsistent#R##N#part of a specification. We extend conflict-driven SAT-solver to provide a new conflict-driven depth-first-search solver for temporal logic. We use this solver to compute LTL unsatisfiable cores, whithout re-exploring the history of the solver. We provide sound and complete proofs together with complexity results.

Connected through hyperedge HE-1 (induced by source paper "extracting unsatisfiable cores for ltl via temporal resolution"):
  with members:
    - "computing minimal sets on propositional formulae i problems reductions"
    - "resolution proof transformation for compression and interpolation"
    - "enhancing unsatisfiable cores for ltl with information on temporal relevance"
    - "on the complexity of computing minimal unsatisfiable ltl formulas"
    - "computing small unsatisfiable cores in satisfiability modulo theories"
    - "linear encodings of bounded ltl model checking"
    - "clausal temporal resolution"

Connected through hyperedge HE-2 (induced by source paper "enhancing unsatisfiable cores for ltl with information on temporal relevance"):
  with members:
    - "extracting unsatisfiable cores for ltl via temporal resolution"
    - "a fully automatic problem solver with human style output"
    - "on the complexity of computing minimal unsatisfiable ltl formulas"
    - "computing small unsatisfiable cores in satisfiability modulo theories"
    - "clausal temporal resolution"

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.LO(Logic in Computer Science)