Abstract
Soft temporal constraints problems allow for a natural description of scenarios where events happen over time and preferences are associated with event distances and durations. However, sometimes such local preferences are difficult to set, and it may be easier instead to associate preferences to some complete solutions of the problem, and then to learn from them suitable preferences over distances and durations.
In this paper, we describe our learning algorithm and we show its behaviour on classes of randomly generated problems. Moreover, we also describe two solvers (one more general and the other one more efficient) for tractable subclasses of soft temporal problems, and we give experimental results to compare them.
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
A. Biso, F. Rossi, and A. Sperduti. Experimental Results on Learning Soft Constraints. Proc. KR 2000, Morgan Kaufmann, 2000.
Abstracting Soft Constraints. S. Bistarelli, P. Codognet, Y. Georget, F. Rossi. Proc. ERCIM/Compulog Net work. on constraints, Springer, LNAI 1865, 2000.
S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the A CM, 44(2):201–236, March 1997.
R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, Vol. 49, 1991, pp. 61–95.
D. Dubois, H. Prade. Processing Fuzzy Temporal Knowledge. IEEE Trans. On systems, Man, and Cybernetics, 19:4, 1989.
M. Giacomin. From Crisp to Fuzzy Constraints Networks. Proc. CP’ 01 Workshop on Modelling and Solving Problems with Soft Constraints, 2001.
S. Haykin. Neural Networks: a comprehensive Foundation. IEEE Press, 1994.
L. Khatib, P. Morris, R. Morris, F. Rossi. Temporal Constraint Reasoning With Preferences. Proc. IJCAI 2001.
L. Khatib, P. Morris, R. Morris, F. Rossi, A. Sperduti. Learning Preferences on Temporal Constraints: A Preliminary Report. Proc. TIME 2001, IEEE Comp. Soc. Press, 2001.
R. Marin, M. A. Cardenas, M. Balsa, J. L. Sanchez. Obtaining solutions in Fuzzy Constraint Networks. Int. Jour. of Approximate Reasoning, 16:261–288, 1997.
F. Rossi and A. Sperduti. Learning solution preferences in constraint problems. Journal of Experimental and Theoretical Computer Science, 1998. Vol 10.
T. Schiex. Possibilistic constraint satisfaction problems, or “how to handle soft constraints?”. Proc. 8th Conf. of Uncertainty in AI, pages 269–275, 1992.
E. Schwalb, R. Dechter. Coping with disjunctions in temporal constraint satisfaction problems. Proc. AAAI-93, 1993.
S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 1995.
L. Vila, L. Godo. On fuzzy temporal constraint networks. Mathware and Soft Computing, 3:315–334, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossi, F., Sperduti, A., Venable, K.B., Khatib, L., Morris, P., Morris, R. (2002). Learning and Solving Soft Temporal Constraints: An Experimental Study. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive