Infinite Qualitative Simulations by Means of Constraint Programming
| dc.creator | Apt, Krzysztof R. | |
| dc.creator | Brand, Sebastian | |
| dc.date | 2006-08-03 | |
| dc.date.accessioned | 2026-07-07T07:19:57Z | |
| dc.date.available | 2026-07-07T07:19:57Z | |
| dc.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. | |
| dc.description | 15 pages; 12th International Conference on Principles and Practice of Constraint Programming (CP'06) | |
| dc.identifier | https://arxiv.org/abs/cs/0608017 | |
| dc.identifier | http://arxiv.org/abs/cs/0608017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114815 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.title | Infinite Qualitative Simulations by Means of Constraint Programming | |
| dc.type | text |