𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Temporal Annotated Constraint Logic Programming

✍ Scribed by THOM FRÜHWIRTH

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
712 KB
Volume
22
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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 of variables and quantifiers as encountered in first order approaches. Unlike temporal logic, both qualitative and quantitative (metric) temporal reasoning about definite and indefinite information with time points (instants) and time periods (temporal intervals) in different models of time are supported.

Our temporal annotated logic can be made an instance of annotated constraint logic, which is also presented in this paper. Given a logic in this framework, there is a systematic way to make a clausal fragment executable as a constraint logic program. We show this for the generic case and for the specific case of temporal annotated logic. In both cases we give an interpreter and a compiler that can be implemented in standard constraint logic programming languages.

📜 SIMILAR VOLUMES

Annotated fuzzy logic programs
Annotated fuzzy logic programs
✍ Tru H. Cao 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Several fuzzy logic programming systems that deal with fuzzy sets as data in programs have been developed, but they lack the fundamentals of a theorem prover, whence the soundness and the completeness cannot be proved. Annotated logic programs have been developed as an extension of classical logic p

ACLP: Abductive Constraint Logic Program
ACLP: Abductive Constraint Logic Programming
✍ A.C. Kakas; A. Michael; C. Mourlas 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 349 KB

This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its non-trivial integration with constraint solving. This integra

Framed temporal logic programming
Framed temporal logic programming
✍ Zhenhua Duan; Xiaoxiao Yang; Maciej Koutny 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 622 KB

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, ca

Experiments in reactive constraint logic
Experiments in reactive constraint logic programming
✍ Francois Fages; Julian Fowler; Thierry Sola 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 872 KB

In this paper we study a reactive extension of constraint logic programming (CLP). Our primary concerns are search problems in a dynamic environment, where interactions with the user (e.g. in interactive multi-criteria optimization problems) or interactions with the physical world (e.g. in time evol