Presentation:

QeCode is an open-source Quantified Constraint Satisfaction Problems (QCSP) solver based on the Constraint Solver Gecode. QCSP are an extension of classical CSP in which variables may be universally quantified.  It allows to model uncertainty about the data or the presence of an adversary.  Applications are found in areas of game playing, uncertainty handling, conformant planning, robust scheduling, model checking, testing.

QeCode is developped by:

1. Marco Benedetti
   

2. Arnaud Lallouet
   

3. Jérémie Vautard
   

Documentation:

Documentation is provided as:

1. A short manual in pdf.
   

2. A Doxygen documentation available to browse or download.
   

Download:

QeCode 2.0 is available along with Gecode (check the contribs/folder).

This version mainly introduces strategy extraction of QCSP (i.e. Qecode now provides the complete answer to a QCSP, not just true/false !) and handling of QCOP+, the optimization version of QCSP+.

Compiling:

from the Gecode sources archives, execute "make -f Makefile.contribs" to include Qecode in the Gecode configration file. Then, build GeCode with your favorite options using the typical procedure :

1. ./configure {options}
   

2. make
   

3. make install
   

See the Examples folder to learn how to build and solve a QCSP (+) problem. This folder also contains a COMPILING text file explaining how to compile the examples.

Contact and Troubleshooting:

1. For general information or functionality request, please contact all the authors by clicking here.
   

2. For technical information or bug report, please send a message to Jérémie Vautard.
   

Publications:

1. M. Benedetti, A. Lallouet, J. Vautard: Quentified Constraint Optimization, in CP 2008, Principles and practice of Constraint Programming, Sydney, Australia, September 14-18, 2008.
   

2. M. Benedetti, A. Lallouet, J. Vautard: Modeling adversary scheduling with QCSP+, in SAC 2008, ACM Symposium on Applied Computing, Fortaleza, Brazil, March 15-21, 2008.
   

3. M. Benedetti, A. Lallouet, J. Vautard: QCSP Made Practical by Virtue of Restricted Quantification, in IJCAI 2007, International Joint Conferences on Artificial Intelligence, Hyderabad, India, January 6-12, 2007 [pdf] (from the online proceedings).
   

4. M. Benedetti, A. Lallouet, J. Vautard : Reusing CSP propagators for QCSPs, in CSCLP'06, Joint Annual Workshop of the ERCIM Working Group on Constraints and the CoLogNET area on Constraint and Logic Programming, Francisco Azevedo, Pedro Barahona, Francois Fages and Francesca Rossi eds, UNL, Lisbon, Portugal, June 26-28, 2006.
   

Licence:

QeCode is Copyright Marco Benedetti, Arnaud Lallouet and Jérémie Vautard, Université d'Orléans, 2006-2010.

This software is released under the MIT license:

Permission is hereby granted, free of charge, to any person obtaining a copy

of this software and associated documentation files (the "Software"), to deal

in the Software without restriction, including without limitation the rights

to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

copies of the Software, and to permit persons to whom the Software is

furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in

all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN

THE SOFTWARE.