Abstract
We devise a general framework for formalizing Description Logic Based Dynamic Systems that is parametric w.r.t. the description logic knowledge base and the progression mechanism. We study verification and adversarial synthesis for specifications expressed in a variant of first-order μ-calculus, with a controlled form of quantification across successive states. We provide key decidability results for both verification and synthesis, under a "bounded-state" assumption. We then study two instantiations of this general framework, where the knowledge base is expressed in DL-Lite and A{script}葦C{script}Q{script}, respectively. © 2013 CEUR Workshop Proceedings.