𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Framed temporal logic programming

✍ Scribed by Zhenhua Duan; Xiaoxiao Yang; Maciej Koutny

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
622 KB
Volume
70
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Temporal Annotated Constraint Logic Prog
Temporal Annotated Constraint Logic Programming
✍ THOM FRÜHWIRTH πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 712 KB

We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulae can be labelled with temporal information using annotations. In this way we avoid the proliferation

Time-extraction for temporal logic-logic
Time-extraction for temporal logic-logic programming and local process time
✍ Takashi Hattori πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 783 KB

Temporal logic is useful to describe a variety of computer systems such as operating systems and real-time process control systems, where explicit treatment of time plays an essential role. In the logic, the notion of time is represented by a sequence of states at each point in time, which is called

Dealing with Multiple Granularity of Tim
Dealing with Multiple Granularity of Time in Temporal Logic Programming
✍ CHUCHANG LIU; MEHMET A. ORGUN πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 664 KB

Chronolog(MC) is an extension of logic programming based on a linear-time temporal logic with multiple granularity of time called TLC . A Chronolog(MC) program consists of a clock definition, a clock assignment and a program body. Each predicate symbol appearing in the program body is associated wit

Recursive logic frames
Recursive logic frames
✍ Saharon Shelah; Jouko VÀÀnΓ€nen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 235 KB

We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive logic frame is called complete (recursively compact, β„΅0-compact

Interference logic = conditional logic +
Interference logic = conditional logic + frame axiom
✍ Luis FariΓ±as del Cerro; Andreas Herzig πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 582 KB

We investigate the notion of interference between formulas as a basis for change operations. Such a notion permits us to enrich conditional logics with a frame axiom. This new logic allows us to solve in a natural way some of the problems appearing in the model based approach to change. 0 1994 John