Abstract
Specifying and interpreting temporal constraints are key elements of knowledge representation and reasoning, with applications in temporal databases, agent programming, and ambient intelligence. We present and formally characterize the language CG, which tackles this issue. In CG, users are able to develop time-dependent programs, in a flexible and straightforward manner. Such programs can, in turn, be coupled with evolving environments, thus empowering users to control the environment's evolution. CG relies on a structure for storing temporal information, together with a dedicated query mechanism. Hence, we explore the computational complexity of our query satisfaction problem. We discuss previous implementation attempts of CG and introduce a novel prototype which relies on logic programming. Finally, we address the issue of consistency and correctness of CG program execution, using the Event-B modeling approach.
Highlights
Specifying and reasoning about phenomena that evolve in time are essential traits of any intelligent system
We consider that our approach has interesting advantages with respect to the traditional line of research based on temporal logics such as LTL, CTL
We are less interested in eventuality or maintenance of properties, which are typical for model checking [4,5,6,7] and for deductive reasoning [8,9,10,11] in temporal logics
Summary
Specifying and reasoning about phenomena that evolve in time are essential traits of any intelligent system Their key components are usually identified as (i) representing the temporal behaviour of a system and (ii) extracting information which is otherwise implicit in the system representation. We consider that our approach has interesting advantages with respect to the traditional line of research based on temporal logics such as LTL, CTL (for a more detailed motivation see, e.g., [3]). Our framework consists of (i) a representation of an evolution path of a system, one which is tailored for capturing temporal relations between the system properties, (ii) a temporal language which we employ for expressing complex temporal constraints between properties, as shown in the above example, and (iii) a rule-based programming language, CG, which allows the programmer to specify time-dependent programming.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
