Related Experiment Video
Updated: Apr 14, 2026

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
Published on: February 9, 2017
Declarative Programming with Temporal Constraints, in the Language CG
1POLITEHNICA University of Bucharest, Splaiul Independentei 303, 060042 Bucharest, Romania.
We introduce CG, a novel language for specifying and interpreting temporal constraints in time-dependent programs. This system enhances control over evolving environments and ensures program correctness using logic programming and Event-B modeling.
Area of Science:
- Knowledge Representation and Reasoning
- Temporal Logic
- Computer Science
Background:
- Temporal constraints are crucial for knowledge representation and reasoning.
- Applications include temporal databases, agent programming, and ambient intelligence.
Purpose of the Study:
- To present and formally characterize the CG language for temporal constraint specification.
- To enable users to develop flexible, time-dependent programs for controlling evolving environments.
Main Methods:
- Formal characterization of the CG language.
- Exploration of the computational complexity of the query satisfaction problem.
- Implementation using logic programming and verification with Event-B modeling.
Main Results:
- A novel language (CG) for temporal constraint specification and interpretation.
- A new prototype implementation of CG leveraging logic programming.
- Formal analysis of query satisfaction complexity and program execution correctness.
Conclusions:
- CG provides a flexible and straightforward approach to time-dependent programming.
- The Event-B modeling approach ensures consistency and correctness of CG program execution.
Related Concept Videos
Constraints and Statical Determinacy
Statically Indeterminate Problem Solving
Castigliano's Theorem: Problem Solving
Deductive Reasoning
For example, a researcher can deduce specific predictions...
Theorems of Pappus and Guldinus: Problem Solving
Synthetic Disvision of Polynomials

