pith. sign in

arxiv: cs/0504024 · v1 · submitted 2005-04-07 · 💻 cs.AI · cs.LO

Constraint-Based Qualitative Simulation

classification 💻 cs.AI cs.LO
keywords qualitativesimulationconstraintconstraintsanswerapproachbenefitcaptured
0
0 comments X
read the original abstract

We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally captured by means of constraints expressed in temporal logic and constraint satisfaction problems. The constraints relate at each stage the 'past' of a simulation with its 'future'. The benefit of this approach is that it readily leads to an implementation based on constraint technology that can be used to generate simulations and to answer queries about them.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.