pith. sign in

arxiv: cs/0608017 · v1 · submitted 2006-08-03 · 💻 cs.AI · cs.LO

Infinite Qualitative Simulations by Means of Constraint Programming

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

We introduce a constraint-based framework for studying infinite qualitative simulations concerned with contingencies such as time, space, shape, size, abstracted into a finite set of qualitative relations. To define the simulations, we combine constraints that formalize the background knowledge concerned with qualitative reasoning with appropriate inter-state constraints that are formulated using linear temporal logic. We implemented this approach in a constraint programming system by drawing on ideas from bounded model checking. The resulting system allows us to test and modify the problem specifications in a straightforward way and to combine various knowledge aspects.

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.