🚀 go-pugleaf

The foolowing paper describes an implemention of various kinds of
temporal constraints with constraint handling rules (were named
"constraint simplification rules" before) on top of ECRC's 
Eclipse Prolog.

Temporal Reasoning with Constraint Handling Rules
Thom Fruehwirth

This paper describes an application of constraint handling rules
to temporal reasoning and illustrates the conceptual simplicity 
and flexibility of the approach. 
Following the framework of Meiri (AAAI 91), temporal reasoning 
is viewed as a constraint satisfaction problem about location of 
temporal variables along the time line. Temporal variables may 
be points or intervals and temporal constraints are disjunctions 
of qualitative or quantitative primitive binary temporal 
relations.
We use constraint logic programming augmented with constraint 
handling rules to define a incremental, flexible general purpose 
solver for disjunctive binary constraints based on path 
consistency and backtrack search. We show how this approach
supports rapid prototyping and experimentation with various 
approaches and variants to temporal reasoning and constraint 
satisfaction techniques in general.


thom