Operational Semantics of Framed Temporal Logic Programs

Authors:
Xiaoxiao Yang;Zhenhua Duan
Affiliations:
Institute of Computing Theory and Technology, Xidian University, Xi'an, 710071, P.R. China;Institute of Computing Theory and Technology, Xidian University, Xi'an, 710071, P.R. China
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 8
Cited 0

Executing temporal logic programs

Executing temporal logic programs
Temporal logic programming

Temporal logics and their applications
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog

Proceedings of the Third International Conference on Logic Programming
Projection in Temporal Logic Programming

LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
A framed temporal logic programming language

Journal of Computer Science and Technology
Semantics of framed temporal logic programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the operational semantics of framed temporal logic programs. To this end, a framed temporal logic programming language called Framed Tempura is employed. The evaluation rules for both the arithmetic and boolean expressions are defined. The semantic equivalence rules for the reduction of a program within a state is formalized. Furthermore, the congruence and transition rules between configurations for the reduction of programs are also specified. Thus, the executable behavior of framed programs can be captured in an operational way. In addition, the consistency of the operational semantics and the minimal model semantics based on model theory is proved.