Infinite Qualitative Simulations by Means of Constraint Programming

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
15 pages; 12th International Conference on Principles and Practice of Constraint Programming (CP'06)

Keywords

Artificial Intelligence, Logic in Computer Science

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/114815

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0608017
 http://arxiv.org/abs/cs/0608017

Collections

arXiv