 |
20 elements available | | | Call for papers for CROCS at CP-10, the 3rd International Workshop on Constraint Reasoning and Optimization for Computational Sustainability, to be held on September 6, 2010 in St Andrews, Scotland, in conjunction with the CP-10 conference.
For submission and other details, please see http://www.computational-sustainability.org/crocs-at-cp10 |
| |  | |  |
| | |
| | The International Conference on Principles and Practice of Constraint Programming is the annual conference on all aspects of computing with constraints, including: theory, algorithms, applications, environments, languages, models and systems.
This year it will be held in St Andrews, Scotland from 6-10th September 2010.
Submission for tutorial and workshop proposals, as well as submission of technical and application papers is currently open. PhD students are invited to apply for the Doctoral Programme.
See the website for details. |
| | | | |
| | |
| | CROCS-09 submission deadline extended to August 23, 2009
Call for Papers, Abstracts, and Discussion Topics: CROCS 2009, the First International Workshop on Constraint Reasoning and Optimization for Computational Sustainability, September 20, 2009, Lisbon, Portugal
To be held in conjunction with CP-09, the 15th International Conference on Principles and Practice of Constraint Programming.
For more information on this workshop as well as the newly emerging interdisciplinary field of computational sustainability, please visit http://www.computational-sustainability.org/crocs09.
Best,
Ashish |
| | | | |
| | |
| |
SymCon'09 First Call for Papers
The Ninth International Workshop on Symmetry and Constraint Satisfaction Problems
To be held at the Fifteenth International Conference on Principles and Practice of Constraint Programming (CP 2009)
Lisbon, Portugal, September 20, 2009
Submission deadline: Monday, 29 June 2009
Notification of acceptance: Friday, 31 July 2009
Camera ready deadline: Friday, 14 August 2009
Workshop: Sunday, 20th September 2009
***For more information, please see the Call for Papers at: http://alexf04.maclisp.org/symcon09.html
Workshop topics include, but are not limited to:
- Symmetry definition: semantic symmetry, syntactic symmetry, constraint symmetry, solution symmetry
- Automatic symmetry detection: static approaches and dynamic approaches
- Global symmetry detection and elimination
- Dynamic symmetry detection and elimination
- Combining symmetry breaking techniques
- Exploiting weak forms of symmetries like "dominance" and "almost-symmetries"
- Case studies of problems that exhibit interesting symmetries
- Application of computational group theory techniques to symmetry breaking
- Heuristics that use information about symmetry to guide search - Elimination and avoidance of symmetry by re-modelling
- Dynamic avoidance of symmetric states during search
- Complexity analysis of symmetry breaking techniques
- Application of CSPs to symmetry and related algebraic problems - Comparing symmetry breaking techniques in constraint
programming with techniques for dealing with symmetry in other search domains
- Symmetry in CNF formulas and OBF formulas
- Symmetry in finite model search in first order logic
- Novel exploitation of symmetry in varied search domains of interest to the CP community
***For more information, please see the Call for Papers at: http://alexf04.maclisp.org/symcon09.html
|
| | | | |
| | |
|  | |  | | | | | Date: | 27-Apr-2009 | | Title: | The Second Answer Set Programming Competition
| | Hits: | 443 | | Contributed by: | | | | | | | | | Date: | 03-Mar-2009 | | Title: | Call for Participation: The Second Answer Set Programming Competition
| | Hits: | 499 | | Contributed by: | | | | | | | | | Date: | 04-Feb-2009 | | Title: | The Second Answer Set Programming Competition
| | Hits: | 547 | | Contributed by: | | | | FznTini is a general constraint solver purely based on SAT. It solves constraint satisfaction and optimization problems written in FlatZinc (not involving floating point numbers) via Booleanization and calls to the Tinisat SAT solver. It can also print Booleanizations of constraint models in DIMACS CNF, to be solved by independent SAT solvers (convenient way to generate SAT benchmarks). Constraint modeling languages that have translations to FlatZinc, such as MiniZinc, are automatically supported as well. |
| | | | |
| | |
| | | We are delighted to announce that a special issue on the Next 10 Years of Constraint Programming: has appeared as Volume 1 of Constraint Programming Letters:
Constraint Programming Letters (CPL) provides an international forum for the electronic publication of high-quality scholarly articles on constraint programming. All published papers are freely available online.
This special issue collects invited papers following the workshop on "The next 10 years of constraint programming" that took place at the International Conference on Constraint Programming in Nantes, France in 2006.
The guest editors,
Lucas Bordeaux, Barry O’Sullivan, Pascal Van Hentenryck |
| | | | |
| | |
| | We are pleased to announce the open source availability of the
Decision Procedure Toolkit (DPT). DPT is a modern SMT solver. This
release provides a MiniSAT-like DPLL solver, a DPLL(T) style theory
combination mechanism, and a solver for the theory of Uninterpreted
Functions (EUF). The next release will add a linear arithmetic solver
and a cooperation mechanism for more than one theory.
DPT is an open source project licensed under the Apache 2.0 license.
You can download DPT from sourceforge.
DPT is intended to serve as a platform for experiments in SMT solvers
and their applications. Subsequent releases will include features
like model generation, proof production and interpolants. We also
expect to support parametric theories and the HOL logic.
The DPT design philosophy emphasizes flexible interfaces and
transparent implementation over raw speed. DPT is implemented in
OCaml. These decisions not withstanding, speed is good, and so we
have made a reasonable effort to ensure DPT is fast.
Further announcements about DPT will be made on the dpt-announce mailing
list. You can subscribe to the list via the project web site.
Kind regards,
Amit Goel, Jim Grundy and Sava Krstic |
| | | | |
| | |
| | | | | | | | Date: | 14-May-2007 | | Title: | First Workshop on Autonomous Search
| | Hits: | 1012 | | Contributed by: | | |
Call for Papers
Constraints Journal
Special Issue on Quantified CSPs and QBF
Guest Editors
Enrico Giunchiglia, Universita di Genova, Italy
Kostas Stergiou, University of the Aegean , Greece
Introduction
CSPs and SAT are frameworks that have been successfully used to model and solve a wide variety of
combinatorial problems. However, there are problems from areas such as contingent planning,
adversarial game playing, control design, and model checking that cannot be expressed within these
frameworks. Typically, such problems involve decisions or events that are beyond the control of the
problem solving agent and thus cannot be modelled using standard (existentially quantified)
variables. Quantified CSPs and QBF, which are the extensions of CSPs and SAT that allow for
universally quantified variables, make it possible to model and reason with such problems, as well
as other PSPACE-complete problems that contain “bounded uncertainty”. As a result, these frameworks
have been attracting significant interest in recent years. The main advances have been achieved in
the area of QBF where numerous solvers have been implemented and real problems of considerable size
have been tackled. There is also a significant body of work on quantified numerical constraints,
while recently research works on QCSPs with discrete finite domains have started to emerge. With
this special issue of Constraints, we aim to group together and reflect the state of the art in
these rapidly developing areas of research.
Topics of Interest
This special issue is concerned with all aspects of research in QCSPs and QBF. Topics of interest
include (but are not limited to):
* Solvers for QCSPs or QBF
* Search and propagation techniques
* Quantified numerical constraints
* Complexity results
* Modelling uncertainty using quantified constraints
* Combining/integrating different frameworks and algorithms
* Real-world applications
Paper Submission
Researchers are invited to submit original papers that make a significant contribution to the field
to konsterg@aegean.gr. (Note that the usual on-line submission procedure for the Constraints journal
will not be followed initially for the Special Issue). All submissions should be in .pdf format and
follow Constraints Journal guidelines. Papers of at most 30 journal pages are preferred.
When submitting, please use the subject "Constraints Special Issue Paper Submission" and clearly
specify the e-mail address and phone number of the corresponding author. Receipt of papers will be
acknowledged. Submissions will be reviewed by at least two reviewers. All accepted papers will meet
the usual high-quality standards of the Constraints Journal.
Authors intending to submit should send an expression of interest (including a provisional title,
list of authors and a tentative abstract) to konsterg@aegean.gr by June 1st , 2007 .
Important Dates
Expression of interest: June 1st, 2007
Submission of papers: September 15th, 2007
Notification of acceptance: December 15th, 2007
Final versions of accepted papers: February 15th, 2008
Important Links
* Special issue home page:
http://www.icsd.aegean.gr/lecturers/konsterg/ConstraintsSpecialIssue.html
* Constraints journal home page:
http://ai.uwaterloo.ca/~vanbeek/Constraints/constraints.html
* Guidelines for authors:
http://ai.uwaterloo.ca/~vanbeek/Constraints/Instructions_for_Authors.html
|
| | | | |
| | |
| | | | | | | | Date: | 05-Apr-2007 | | Title: | CFV'07 Call for Papers
| | Hits: | 1498 | | Contributed by: | Miroslav Velev | | Keywords: | Deduction Rules, BMC, DPLL, DP, Minimal models, Intelligent Backtracking, Data structure, Local Search, BDD, Verification, Alternative approach, QBF, Structure of problems, EDA, Benchmark, SAT application, Equivalency Reasoning, Instance simplification, Learning, Satisfiable Problems Generation, SAT tools, Distributed Computing, CSP, Logic, branching heuristics, instance database, QBF, Dynamic restarts, variable ordering heuristic, preprocessors, call for papers, conference information, Boolean functions, Linear Constraints, SAT Hardware, Satisfiability Modulo Theory, Constraint Programming, SAT/CP |
| | | |  |  | |
| | | The Fourth Workshop on Constraints in Formal Verification will take place in Bremen, Germany, on July 16, 2007, as a satellite event of CADE-21.
The submission deadline is May 15, 2007:
http://www.miroslav-velev.com/cfv07.html |
| | | | |
| | |
| |
******************** Call for Participation ***********************
Third International Summer School of the
Association for Constraint Programming
*******************************************************************
Hotel Guitart Central Park
Lloret de Mar, Spain
June 10-15, 2007
http://www.iiia.csic.es/summerschools/sscp2007/
********************************************************************
Constraint Programming is a flourishing area of research aiming at
the efficient solving of combinatorial problems.
The Third International Summer School on Constraint Programming is an
introductory school on Constraint Programming and it is oriented to
PhD students, researchers, and practitioners of
all levels who wish to learn about this area.
The program of the school will include the following courses:
* * Symmetries in CP (Barbara Smith)
* * Continuous constraints (Frederic Benhamou)
* * SAT and CSP (Lucas Bordeaux)
* * Operations Research in CP (John Hooker)
* * CP systems (Christian Schulte)
* * Complexity in Combinatorial Problems (Jerome Lang)
The school will take place in the Hotel Guitart Central Park of Lloret de Mar,
Spain. Lloret de Mar is a sea resort 70 Km North of Barcelona.
Instructions on how to register to the school will be posted soon at the event web page.
For the moment, we can advance that the early registration
fee will be approximately 350 euros and the room rate at the 3 stars hotel will of 53.40 Euros
per night in single room and full board (even cheaper rates can be obtained for double rooms).
|
| | | | |
| | |
| | |
| | | | | | | | Date: | 26-Nov-2006 | | Title: | Special issue of JSAT on CFV
| | Hits: | 2112 | | Contributed by: | Miroslav Velev | | Keywords: | Deduction Rules, BMC, DPLL, DP, Minimal models, Intelligent Backtracking, #P, Data structure, Quasigroups, Local Search, Repository, BDD, Random 3SAT, Stalmark, Complexity, Randomization, Computational logic, MAC, FC, Verification, Alternative approach, QBF, Structure of problems, EDA, Benchmark, SAT application, Equivalency Reasoning, Randomised Algorithms, Randomised Problem Generation, Instance simplification, Learning, Model Elimination, Satisfiable Problems Generation, SAT tools, Distributed Computing, CSP, Logic, branching heuristics, instance database, threshold conjecture, phase transition, binary clause reasoning, QBF, Dynamic restarts, resolution complexity, message-passing algorithm, Linear Programming, programming language, pseudo boolean optimization, variable ordering heuristic, preprocessors, MAXSAT, distributed parallel dynamic learning, Preprocessing, Unit Propagation, symmetry, General Interest, Cellular Automata, Cellection Framework, call for papers, semidefinite programming, conference information, Genetic Algorithm, Boolean functions, SAT-Based, Linear Constraints, SAT Hardware, Lookahead, Generative SAT library, multi-value, Stochastic Satisfiability, Divide-and-Conquer Algorithms, Non-monotonic reasoning, implicativity, stable set of points, stable set of clusters, Satisfiability Modulo Theory, Constraint Programming, genetic programming, SAT/CP, bioinformatics, resolution determinization, SAT-solver, SAT/CP Integration, Hybrid solver, Visualisation, Pseudo-Boolean Solving, Resolution proof |
| | | | | | |
| | | Dear Colleague,
We would like to invite you to submit a paper to the special issue of the
Journal on Satisfiability, Boolean Modeling and Computation (JSAT) on
the topic of application of constraints to formal verification (CFV).
The submission deadline is January 10, 2007.
Topics include, but are not limited to, the following:
- application of constraint solvers to hardware verification;
- application of constraint solvers to software verification;
- dedicated solvers for formal verification problems;
- tuning SAT for formal verification and testing;
- challenging formal verification problems.
The submissions have to be in the JSAT format:
http://www.isa.ewi.tudelft.nl/Jsat/
and have to be e-mailed to: mvelev@gmail.com
If possible, please confirm your intent to submit a paper.
We look forward to your submission,
Miroslav Velev and Joao Marques-Silva
Editors of the special issue of JSAT on CFV |
| | | | |
| | |
| | | | | | | | Date: | 21-Oct-2006 | | Title: | special track on 'applied formal verification' of EuroCAST'07
| | Hits: | 1524 | | Contributed by: | Daniel Le Berre | | Keywords: | DPLL, Local Search, Computational logic, Verification, Alternative approach, QBF, EDA, SAT application, SAT tools, MAXSAT, call for papers, SAT-Based, Satisfiability Modulo Theory, Constraint Programming |
| | | | | | |
| |
special track on 'applied formal verification' of EuroCAST'07 on the
Canarian Islands.
The Workshop concentrates on formal verification engines and to improve
practicability and scalability of formal methods. Topics include, but
not exclusively, the following: Satisfiability (SAT); Satisfiability
Modulo Theories (SMT); Quantified Boolean Formulas (QBF); Constraint
Programming (CP); Equivalence Checking (EC); Model Checking (MC);
Theorem Proving (TP). Case studies and papers in the border line of
verification, including synthesis, compilation and modelling, are also
welcome
Important dates:
- Extended Abstract, 2 pages, deadline 31. October
- Decision 1. December
- Workshop 12.-16. February 2007.
- Full Papers Post-Conference LNCS Volume, 31. April 2007.
|
| | | | |
| | |
| | |
| |
Call for Participation
Second International Summer School of the
Association for Constraint Programming
Advanced School and International Workshop on
GLOBAL CONSTRAINTS
Doryssa Bay Hotel
Samos, Greece
June 18-23, 2006
http://www.cse.unsw.edu.au/~tw/school.html
The Second International Summer School on Constraint Programming is an
advanced school and associated workshop on global constraints. The school
and workshop are aimed at PhD students, researchers, and practitioners of
all levels who wish to learn about this key area in depth. A workshop
will run alongside the school where the very latest research results
in global constraints will be presented. Lecturers include:
Philippe Baptisite, Nicolas Beldiceanu, Christian Bessiere, Mats Carlsson,
Willem-Jan van Hoeve, Irit Katriel, Michela Milano, and Jean-Charles Regin.
The school and workshop will take place in the Doryssa Bay hotel on the
Aegean island of Samos in Greece. The hotel is next to the fishing
village of Pythagorion, the birth place of the Greek philosopher
Pythagoras.
To participate in the advanced school and workshop, please email Toby Walsh
(tw@cse.unsw.edu.au) as soon as possible. As places are limited, you are
encouraged to reserve a place as soon as possible. The early registration
fee will be approximately 300 euros. Student grants will be available to
cover part of the expenses of some students. More details are
available at http://www.cse.unsw.edu.au/~tw/school.html
|
| | | | |
| | |
© 2000-2001 Business & Technology Research Laboratory.
© 2001-2005 Centre de Recherche en Informatique de Lens.
Hosted by Innovation
and Technology Research Lab.
Please send any comment to daniel@satlive.org.
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
