Abstract
Constraints represent a powerful way of specifying knowledge in any problem solving domain. Typically the appropriate constraints for a given problem need to be fully specified. In general it is difficult to describe the appropriate constraints in every problem setting. Hence automatic constraint acquisition is an important problem.
In this paper we develop a model for automatic constraint acquisition. We show that a universal scheme for generalizing constraints specified on variables across any domain, whether continuous or discrete, is not feasible. Here we provide a generalization model for constraints specified in the form of relations with explicit enumeration of allowed tuples. We provide a scheme to generalize the constraints expressed in this form in our model. We discuss the properties of the generalized constraint obtained from input constraints.
We also show that this scheme provides a uniform method of generalization for any type of constraint on variables with finite and discrete domain. In the end we elaborate upon the different applications of our scheme. We show how learning in our scheme can help improve the search efficiency in a CSP,
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ellman T., Abstraction via approximate symmetry. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, Chamberry, France, August 1993.
Freuder E.C. and Wallace R.J., “Generalizing inconsistency learning for constraint satisfaction”, Proceedings of IJCAI-95 the Fourteenth International Joint Conference on Artificial Intelligence, C. Mellish, ed., Morgan Kaufmann.
Han J., “Mining Knowledge at Multiple Concept Levels”, Proc. 4th Int'l Conf. on Information and Knowledge Management (CIKM'95), Baltimore, Maryland, Nov. 1995, pp. 19–24.
Kawamura T. and Furukawa K., “Towards Inductive Generalization in Constraint Logic Programs”, Proceedings of the IJCAI-93 Workshop on Inductive Logic Programming, Chambery France(August 93), pp. 93–104.
Mackworth A., Constraint Satisfaction, in S.C.Shapiro,ed.,The Encyclopedia of AI,pp 285–293,Wiley, New York,1992.
Mizoguchi F. and Ohwada H., “Constraint-directed generalization for learning spatial relations”, Proceedings of the International Workshop on Inductive Logic Programming, ICOT TM-1182, Tokyo 1992.
Muggleton S., Inductive Logic Programming. Academic Press, 1992.
Page C.D., and Frisch A.M., “Generalizing atoms in constraint logic”, Proceedings of the Second International Conference on Knowledge Representation and Reasoning, pp 429–440, 1991.
Scheix T. et al., “Nogood recording for static and dynamic CSP's”, Proc. of International Conference on Tools for AI, 1993.
Shavlik J.W., and Dietterich T.G. (eds.), Readings in machine learning. Morgan Kaufmann Publishers, 1990.
Wu Xindong, Knowledge Acquisition from Databases. Ablex Publishing Corporation, 1995.
Zweben M., Davis E., Daun B.,Drascher E.,Deale M. and Eskey M., Learning to improve constraint-based scheduling, Artificial Intelligence 58 (1992) 271–296.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Padmanabhuni, S., You, JH., Ghose, A. (1998). A framework for learning constraints: Preliminary report. In: Antoniou, G., Ghose, A.K., Truszczyński, M. (eds) Learning and Reasoning with Complex Representations. PRICAI 1996. Lecture Notes in Computer Science, vol 1359. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-64413-X_33
Download citation
DOI: https://doi.org/10.1007/3-540-64413-X_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64413-2
Online ISBN: 978-3-540-69780-0
eBook Packages: Springer Book Archive