The field of formal methods and artificial intelligence is witnessing significant developments in the area of timed and ontology-based systems. Researchers are exploring new approaches to tackle complex problems in automated planning, timed finite state machines, and description logics. A key direction is the integration of ontologies and temporal constraints to enhance the expressiveness and efficiency of planning systems. Another notable trend is the investigation of fragments of qualitative timeline-based planning that can be directly mapped into the nonemptiness problem of deterministic finite automata, avoiding costly determinization steps. Furthermore, the computation of interpolants for description logic concepts is being advanced, with new algorithms and techniques being proposed to handle hard cases. Noteworthy papers in this area include:

• A study on homing and synchronizing sequences for Timed Finite State Machines with output delays, which formally defines these notions and explores their properties.
• A paper on Controlled Query Evaluation under epistemic dependencies, which presents algorithms and experiments for combining epistemic dependencies with optimal GA censors to ensure strong security guarantees.
• A work on the synthesis of timeline-based planning strategies avoiding determinization, which identifies a fragment of qualitative timeline-based planning whose plan-existence problem can be directly mapped into the nonemptiness problem of deterministic finite automata.