---------------------- 2nd CALL FOR PAPERS ----------------------
QCP 2013
The 2013 International Workshop on
Quantified Constraint Programming
Date and Location: July 22-23, 2013, Las Vegas, USA
The 2013 International Workshop on Quantified Constraint Programming
(QCP 2013) will be held in Las Vegas, USA in July 22-23, 2013.
It will be co-located with the 2013 International Conference on
Foundations of Computer Science (FCS 2013). QCP 2013 is an informal
gathering to discuss problems of mutual interest in quantification
of constraints. Authors are invited to submit a full paper for
consideration. All accepted papers will be be made available online.
If there is interest, we can also have published proceedings.
SCOPE: Topics of interest include, but are not limited to, the following:
- Two person games
- Game theory and methods
- Computational Logic
- Logic in computer science
- Quantified Linear Programming
- Quantified Integer Programming
- Quantified Boolean Formulas
- Quantified Constraint Programs
- Open problems in Quantified Programming
- Quantified Logic and Program Verification
- Quantified Logic and Timed Automata
- Empirical studies of algorithms for quantified constraints
- Cutting plane methodologies with proofs
- Puzzle solving
- Computational Complexity
IMPORTANT DATES:
March 31, 2013: Submission of full papers
April 18, 2013: Notification of acceptance (+/- two days)
May 5, 2013 : Final papers + Copyright/Consent + Registration
July 22-23, 2013: QCP 2013 Workshop
Deadlines are firm; late submissions will not be considered.
All submissions will be electronic via:
https://www.easychair.org/conferences/?conf=qcp2013
SUBMISSION OF PAPERS:
Submissions must be in pdf formats (about 10 pages including all
figures, tables, and references - single space, font size of 10
to 12). All reasonable typesetting formats are acceptable.Later,
the authors of accepted papers will be asked to follow a particular
typesetting format to prepare their final papers for publication.
The first page of the paper should include: title of the paper,
name, affiliation, postal address, and email address for each author.
The first page should also identify the name of the Contact Author
and a maximum of 5 topical keywords that would best represent the
content of the paper.
Each paper will be peer-reviewed by two experts in the field for
originality, significance, clarity, impact, and soundness. You are
permitted to submit work that has appeared before, but indicate the
same in your submission.
The Call for Papers can also be found at:
http://www.csee.wvu.edu/~ksmani/qcp13/announce/cfp.pdf
MEMBERS OF PROGRAM COMMITTEE:
Wolfgang Bein, University of Nevada at Las Vegas
Stefano Bistarelli, University of Perugia
Andrei Bulatov, Simon Fraser University
Hans Kleine Buning, University of Paderborn
Berthe Y. Choueiry, University of Nebraska-Lincoln
Pavlos Eirinakis, Athens University of Economics and Business
John Franco, University of Cincinnati
Steve Homer, Boston University
Bakhadyr Khoussainov, University of Auckland
Daniel Kroening, University of Oxford
Orna Kupferman, Hebrew University
Dimitrios Magos, TEI of Athens
Victor Marek, University of Kentucky
Supratik Mukhopadhyay, Louisiana State University
Bart Selman, Cornell University
Natarajan Shankar, SRI International
Helmut Simonis, Cork Constraint Computation Center
Robert Sloan, University of Ilinois at Chicago
Ofer Strichman, Technion University
K. Subramani, West Virginia University
PROGRAM CHAIR:
K. Subramani, West Virginia University
PROGRAM co-CHAIR:
Pavlos Eirinakis, Athens University of Economics and Business
LOCAL ARRANGEMENTS CHAIR:
Wolfgang Bein, University of Nevada at Las Vegas
PUBLICITY CHAIR:
Steve Homer, Boston University
FINANCE CHAIR:
Pavlos Eirinakis, Athens University of Economics and Business
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************