Executing temporal logic programs
Executing temporal logic programs
Temporal logic of programs
Negation in rule-based database languages: a survey
Selected papers of the workshop on Deductive database theory
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Projection in Temporal Logic Programming
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Some Very Compositional Temporal Properties
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
A framed temporal logic programming language
Journal of Computer Science and Technology
Framed temporal logic programming
Science of Computer Programming
Operational Semantics of Framed Temporal Logic Programs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Decidability of propositional projection temporal logic with infinite models
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Model checking propositional projection temporal logic based on SPIN
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
A concurrent temporal programming model with atomic blocks
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Time constraints with temporal logic programming
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A cylinder computation model for many-core parallel computing
Theoretical Computer Science
A complete proof system for propositional projection temporal logic
Theoretical Computer Science
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper investigates semantics of framed temporal logic programs. To this end, a projection temporal logic and its executable subset are presented. Based on this language, a framing technique is introduced. The semantics of a non-framed program is well interpreted by the canonical model. However, since introducing a framing operator destroys monotonicity, a canonical model may no longer capture the intended meaning of a program. Hence, a minimal model theory is developed. Within this model, negation by default is used to manipulate frame operator. Further, the temporal semantics of framed programs is captured by means of the minimal models. The existence of a minimal model for a given framed program is also proved. An example is given to illustrate how the semantics of framed programs can be captured.