Automatic generation of implied constraints

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 73-77

  Charnley, John ^a   Colton, Simon ^a   Miguel, Ian ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING; THEOREM PROVING;

AUTOMATED THEOREM PROVING; AUTOMATIC GENERATION; BASIC FORMULATION; BENCHMARK PROBLEMS; CONSTRAINT-SATISFACTION PROBLEMS; LEARNING PROCESS; MACHINE-LEARNING; PROBLEM FORMULATION; PROBLEM SOLVERS; THEOREM PROVERS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84886004432     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (19)

1. C. Bessiere, R. Coletta, E.C. Freuder, and B. O'Sullivan. Leveraging the learning power of examples in automatic constraint acquisition. In Proceedings of CP, 2004.
2. C. Bessiere, R. Coletta, F. Koriche, and B. O'Sullivan. A SAT-based version space algorithm for acquiring constraint satisfaction problems. In Proceedings of ECML, 2005.
3. C. Bessiere, R. Coletta, and T. Petit. Acquiring parameters of implied global constraints. In Proceedings of CP, 2005.
4. M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In Proc. Programming Languages: Implementations, Logics, and Programs, 1997.
5. J. Charnley and S. Colton. Expressing general problems as CSPs. In Proceedings of the Workshop on Modelling and Solving Problems with Constraints at ECAI, 2006.
6. S Colton. Automated Theory Formation in Pure Mathematics. Springer-Verlag, 2002.
7. S Colton and I Miguel. Constraint generation via automated theory formation. In Proceedings of CP, 2001.
8. D. Duffy. Principles of Automated Theorem Proving. Wiley, 1991.
9. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, SIAM-AMS Proceedings 7, R Karp, ed. pages 43-73, 1974.
10. A.M. Frisch, I. Miguel, and T. Walsh. CGRASS: A system for transforming constraint satisfaction problems. In Proceedings of the Workshop on Constraint Solving and Constraint Logic Programming (LNAI 2627), pages 15-30, 2002.
11. C. Gomes and M. Sellman. Streamlined constraint reasoning. In Proceedings of CP, 2004.
12. F Hoermann. Machine learning case splits for theorem proving. Master's thesis, Dept of Computing, Imperial College, London, 2005.
13. J. Little, C. Gebruers, D. Bridge, and E. Freuder. Capturing constraint programming experience: A case-based approach. In A. Frisch, editor, International Workshop on Reformulating Constraint Satisfaction Problems at CP, 2002.
14. J Little, C Gebruers, D Bridge, and E Freuder. Using case-based reasoning to write constraint programs. In Proceedings of CP, 2003.
15. K. Marriott and P. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.
16. W McCune. The OTTER user's guide. Technical Report ANL/90/9, Argonne National Laboratories, 1990.
17. T. Mitchell. Machine Learning. McGraw Hill, 1997.
18. P. Torres and S. Colton. Applying model generation to concept formation. In Automated Reasoning Workshop, 2006.
19. M. Wallace. Practical applications of constraint programming. Constraints, 1(1/2):139-168, 1996.