Abstract
Adding constraints to a basic CSP model can significantly reduce search,e.g. for Golomb rulers [6]. The generation process is usually performed by hand, although some recent work has focused on automatically generating symmetry breaking constraints [4]and (less so)on generating implied constraints [5]. We describe an approach to generating implied,symmetry breaking and specialisation constraints and apply this technique to quasigroup construction [10].
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
S Colton.Automated Theory ormation in Pure Mathematics. PhD thesis,Division of Informatics,University of Edinburgh,2001.
S Colton, A Bundy,and T Walsh.HR:Automatic concept formation in pure mathematics. In Proceddings of the 16th IJCAI,pages 786–791,1999.
S Colton and I Miguel.Automatic generation of implied and induced constraints. Te hnical Report APES-32-2001,APES Research Group,2001. Available from http://www.dcs.st-and.ac.uk/~apes/apesreports.html.
J Crawford. A theoretical analysis of reasoning by symmetry in first-order logic. In Proceedings of the Workshop on Tractable Reasoning,AAAI, 1992.
A Frisch, I Miguel,and T Walsh.Extensions to proof planning for generating implied constraints. In Proceedings of the 9th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, 2001.
P Galinier, B Jaumard, R Morales,and G Pesant.A constraint-based approach to the Golomb ruler problem. In Proceedings of the 3rd International Workshop on Integration of AI and ORTechniques (CPAIOR-01),2001.
F Laburthe and the OCRE group.Choco:implementing a CP kernel. In Proceedings of the CP00 Post Conference Workshop on Techniques for Implementing Constraint programming Systems (TRICS),2000.
W McCune.The OTTER user’ s guide.Technical Report ANL/90/9,Argonne National Laboratories,1990.
A Schaerf. Scheduling sport tournaments using constraint logic programming. Constraints,4(1):43–65,1999.
J Slaney, M Fujita,and M Stickel.Automated reasoning and exhaustive search: Quasigroupexistence problems.Computers and Mathematics with Applications, 29:115–132,1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colton, S., Miguel, I. (2001). Constraint Generation via Automated Theory Formation. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_42
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive