Infinite Qualitative Simulations by Means of Constraint Programming
<|reference_start|>Infinite Qualitative Simulations by Means of Constraint Programming: 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.<|reference_end|>
@article{apt2006infinite,
    title={Infinite Qualitative Simulations by Means of Constraint Programming},
    author={Krzysztof R. Apt, Sebastian Brand},
    journal={arXiv preprint arXiv:cs/0608017},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0608017},
    primaryClass={cs.AI cs.LO}
}