English

Infinite Qualitative Simulations by Means of Constraint Programming

Artificial Intelligence 2007-05-23 v1 Logic in Computer Science

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.

Keywords

Cite

@article{arxiv.cs/0608017,
  title  = {Infinite Qualitative Simulations by Means of Constraint Programming},
  author = {Krzysztof R. Apt and Sebastian Brand},
  journal= {arXiv preprint arXiv:cs/0608017},
  year   = {2007}
}

Comments

15 pages; 12th International Conference on Principles and Practice of Constraint Programming (CP'06)

R2 v1 2026-07-22T12:26:22.348Z