Advertisement

Constraint Generation via Automated Theory Formation

  • Simon Colton
  • Ian Miguel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

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].

Keywords

Left Identity Constraint Programming Constraint Generation Balance Incomplete Block Design Constraint Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S Colton.Automated Theory ormation in Pure Mathematics. PhD thesis,Division of Informatics,University of Edinburgh,2001.Google Scholar
  2. 2.
    S Colton, A Bundy,and T Walsh.HR:Automatic concept formation in pure mathematics. In Proceddings of the 16th IJCAI,pages 786–791,1999.Google Scholar
  3. 3.
    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.
  4. 4.
    J Crawford. A theoretical analysis of reasoning by symmetry in first-order logic. In Proceedings of the Workshop on Tractable Reasoning,AAAI, 1992.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    W McCune.The OTTER user’ s guide.Technical Report ANL/90/9,Argonne National Laboratories,1990.Google Scholar
  9. 9.
    A Schaerf. Scheduling sport tournaments using constraint logic programming. Constraints,4(1):43–65,1999.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    J Slaney, M Fujita,and M Stickel.Automated reasoning and exhaustive search: Quasigroupexistence problems.Computers and Mathematics with Applications, 29:115–132,1995.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Simon Colton
    • 1
  • Ian Miguel
    • 2
  1. 1.Division of InformaticsUniversity of EdinburghEdinburghUK
  2. 2.Department of Computer ScienceUniversity of YorkHeslingtonUK

Personalised recommendations