Logic programming with temporal constraints

Combines logic programming and temporal constraint processing techniques in a language called TCLP (Temporal Constraint Logic Programming), which augments logic programs with temporal constraints. Known algorithms for processing disjunctions in temporal constraint networks are applied. We identify a...

Full description

Saved in:
Bibliographic Details
Published in:Temporal Representation and Reasoning, 3rd Workshop On: Time 96 pp. 51 - 56
Main Authors: Schwalb, E., Vila, L.
Format: Conference Proceeding
Language:English
Published: IEEE 1996
Subjects:
ISBN:0818675284, 9780818675287
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Combines logic programming and temporal constraint processing techniques in a language called TCLP (Temporal Constraint Logic Programming), which augments logic programs with temporal constraints. Known algorithms for processing disjunctions in temporal constraint networks are applied. We identify a decidable fragment called Simple TCLP, which can be viewed as extending Datalog with limited functions to accommodate intervals of occurrence and temporal constraints between them. Some of the restrictions introduced by Simple TCLP are overcome by a syntactic structure which provides it with the benefits of reification. The latter allows quantification on temporal occurrences and relation symbols.
ISBN:0818675284
9780818675287
DOI:10.1109/TIME.1996.555679