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 "model checking the interval way"):
  Abstract: [...] The most famous model checking (MC) techniques were developed from the late 80s, bearing in mind the well-known "point-based" temporal logics LTL and CTL. However, while the expressiveness of such logics is beyond doubt, there are some properties we may want to check over system models that are inherently "interval-based" and thus cannot be expressed by point-based temporal logics, e.g., "the proposition p has to hold in at least an average number of system states in a given computation sector". Here interval temporal logics (ITLs) come into play, providing an alternative setting for reasoning about time. Such logics deal with intervals, instead of points, as their primitive entities: this feature gives them the ability of expressing temporal properties, such as actions with duration, accomplishments, and temporal aggregations, which cannot be dealt with in standard point-based logics. The Halpern and Shoham's modal logic of time intervals (HS) is one of the most famous ITLs: it features one modality for each of the 13 possible ordering relations between pairs of intervals, apart from equality. In this thesis we focus our attention on MC based on HS, in the role of property specification language, for which a little work has been done if compared to MC for point-based temporal logics. We study the complexity of such problem considering different system models, and we also compare the expressive power of HS to that of LTL, CTL and CTL* in MC. [...]

Includes members:
  Member "complexity of timeline based planning over dense temporal domains exploring the middle ground":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "undecidability of future timeline based planning over dense temporal domains")
  Member "interval vs point temporal logic model checking an expressiveness comparison":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "model checking for fragments of halpern and shoham s interval temporal logic based on track representatives")
  Member "model checking for fragments of halpern and shoham s interval temporal logic based on track representatives":
    also connected through other hyperedges:
      (none)
  Member "on the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of tiling problems")
  Member "checking interval properties of computations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interval vs point temporal logic model checking an expressiveness comparison")
  Member "complexity hierarchies beyond elementary":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the ideal approach to computing closed subsets in well quasi orderings")
  Member "complexity of itl model checking some well behaved fragments of the interval logic hs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interval vs point temporal logic model checking an expressiveness comparison")
  Member "interval based synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "model checking for fragments of halpern and shoham s interval temporal logic based on track representatives")

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