Global Constraint Seeker: How to enter examples and how to interpret results

N. Beldiceanu(*) and H. Simonis(+)
2 May 2011

*: Mines de Nantes, LINA UMR 6241, FR-44307 Nantes, France
   Nicolas.Beldiceanu@mines-nantes.fr
+: Cork Constraint Computation Centre, Department of Computer Science, 
   University College Cork, Ireland
   h.simonis@4c.ucc.ie

1. How to enter examples

The user provides positives and/or negative ground instances for a constraint without needing to know neither the name of the constraint, nor the order of its arguments. Each positive or negative ground instance has the form
p(Arg1,Arg2,...,Argk)
where each
Arg1,Arg2,...,Argk
corresponds to one of the following: Examples of valid inputs are for instance: You can select positive or negative examples by a small menu in front of the example input. Also note that since they do not provide a lot of information, empty lists or sublists are not particulary useful, even though the seeker does handle them correctly.

2. How to interpret results

Results are displayed as the following three lists: