Abstract
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially useful in a real-time process control or online interactive context. The conventional machinery for ensuring backtrack-free search, however, adds additional constraints, which may require an impractical amount of space. A new approach is presented here that achieves a backtrack-free representation by removing values. This may limit the choice of solutions, but we are guaranteed not to eliminate them all. We show that in an interactive context our proposal allows the system designer and the user to collaboratively establish the tradeoff in space complexity, solution loss, and backtracks.
This work has received support from Science Foundation Ireland under Grant 00/PI.1/C075 and from the Embark Initiative of the Irish Research Council of Science Engineering and Technology under Grant PD2002/21.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic csps – application to configuration. Artificial Intelligence 135, 199–234 (2002)
Debruyne, R., Bessière, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research (14), 205–230 (2001)
Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 14, 205–230 (1987)
Freuder, E.C.: A sufficient condition for backtrack-free search. Journal of ACM 29(1), 24–32 (1982)
Freuder, E.C.: Complexity of k-tree structured constraint-satisfaction problems. In: Proceedings of the Eigth National Conference on Artificial Intelligence (AAAI 1990), pp. 4–9 (1990)
Freuder, E.C., Hubbe, P.D.: Using inferred disjunctive constraints to decompose constraint satisfaction problems. In: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI 1993), pp. 254–261 (1993)
Freuder, E.C., Wallace, R.J., Heffernan, R.: Ordinal constraint satisfaction. In: 5th International Workshop on Soft Constraints-Soft 2003 (2003)
Hubbe, P.D., Freuder, E.C.: An efficient cross-product representation of the constraint satisfaction problem search space. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), pp. 421–427 (1992)
Lesaint, D.: Maximal sets of solutions for constraint satisfaction problems. In: Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 110–114 (1994)
Muscettola, N., Morris, P., Tsamardinos, I.: Reformulating temporal plans for efficient execution. In: Principles of Knowledge Representation and Reasoning, pp. 444–452 (1998)
Vempaty, N.R.: Solving constraint satisfaction problems using finite satate automata. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), pp. 453–457 (1992)
Weigel, R., Faltings, B.: Compiling constraint satisfaction problems. Artificial Intelligence 115(2), 257–287 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beck, J.C., Carchrae, T., Freuder, E.C., Ringwelski, G. (2004). Backtrack-Free Search for Real-Time Constraint Satisfaction. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive