Framed temporal logic programming

被引：57

作者：

Duana, Zhenhua ^{[1
]}

Yanga, Xiaoxiao ^{[1
]}

Koutnyb, Maciej ^{[2
]}

机构：

[1] Xidian Univ, Inst Comp Theory & Technol, Xian 710071, Peoples R China

[2] Univ Newcastle Upon Tyne, Sch Comp Sci, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England

来源：

SCIENCE OF COMPUTER PROGRAMMING | 2008年 / 70卷 / 01期

基金：

中国国家自然科学基金;

关键词：

temporal logic programming; framing; minimal model; monotonicity; synchronization; communication; semantics;

D O I：

10.1016/j.scico.2007.09.001

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in temporal logic programming is presented. Since framing destroys monotonicity, canonical models - used to define the semantics of non-framed programs - are no longer appropriate. To deal with this, a minimal model theory is developed, using which the temporal semantics of framed programs is captured. The existence of a minimal model for a given framed program is demonstrated. A synchronous communication mechanism for concurrent programs is provided by means of the framing technique and minimal model semantics. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：31 / 61

页数：31

共 27 条

[1]

[Anonymous], 1987, TEMPORAL LOGIC PROGR

[2]

[Anonymous], 1986, EXECUTING TEMPORAL L

[3]

BARRINGER H, 1989, LNCS, V430

[4]

BIDOIT N, 1991, THEOR COMPUT SCI, V78, P3, DOI 10.1016/0304-3975(51)90003-5

[5] A decision procedure and complete axiomatization of finite interval temporal logic with projection [J].

Bowman, H ;

Thompson, S .

JOURNAL OF LOGIC AND COMPUTATION, 2003, 13 (02) :195-239

[6]

BOWMAN H, 1997, APPL LOGIC SERIES

[7]

BOWMAN H, 1998, LNAI, V1397

[8]

Duan Z, 2006, TEMPORAL LOGIC TEMPO

[9]

DUAN Z, 1994, LECT NOTES ARTIF INT, V822, P333

[10] Semantics of framed temporal logic programs [J].

Duan, ZH ;

Yang, XX ;

Koutny, M .

LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 :356-370

← 1 2 3 →