e apologize for multiple copies of this Call.

================================================================

Call for Papers

SymCon'07

The Seventh International Workshop

on Symmetry and Constraint Satisfaction Problems

(http://www.cmi.univ-mrs.fr/~benhamou/symcon07/)

To be held at the Thirteenth International Conference

on Principles and Practice of Constraint Programming (CP 2007)

Providence, RI, USA

September 23rd 2007

================================================================

WORKSHOP DESCRIPTION

--------------------

SymCon'07 is the 7th in a series of workshops affiliated with the CP

conference, and focuses on the investigation of symmetry and symmetry

breaking techniques for Constraint Satisfaction Problems (CSPs).

Symmetries occur frequently in CSPs. When undetected, they cause

thrashing during traditional backtracking search by redundantly

exploring symmetric parts of the search space. The topic was

discussed as far back as 1874 by Glaisher, and new techniques to

detect and/or break symmetry have been proposed in recent years.

However, many outstanding problems remain. For instance, the

detection and exploitation of local, dynamic, and weak forms of

symmetry remains a challenge.

The workshop is a forum for researchers to present advances in

symmetry breaking techniques and to discuss the above or other open

problems. Additionally, the workshop welcomes the presentation of

applications and case studies that exhibit some form of symmetry. The

workshop is relevant to the computational group theory (CGT) community

because CGT is often the theory underlying many symmetry breaking

techniques. Importantly, the organizers welcome submissions from

researchers working in other areas of Artificial Intelligence who feel

that their work would be of interest to the CP community. Such areas

include planning, model checking, QBF formulas, finite model search,

and theorem proving in FOL.

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

ATTENDANCE

----------

The workshop is open to all members of the CP community. At least one

author of each submission accepted for presentation must attend the

worksh

e apologize for multiple copies of this Call.

================================================================

Call for Papers

SymCon'07

The Seventh International Workshop

on Symmetry and Constraint Satisfaction Problems

(http://www.cmi.univ-mrs.fr/~benhamou/symcon07/)

To be held at the Thirteenth International Conference

on Principles and Practice of Constraint Programming (CP 2007)

Providence, RI, USA

September 23rd 2007

================================================================

WORKSHOP DESCRIPTION

--------------------

SymCon'07 is the 7th in a series of workshops affiliated with the CP

conference, and focuses on the investigation of symmetry and symmetry

breaking techniques for Constraint Satisfaction Problems (CSPs).

Symmetries occur frequently in CSPs. When undetected, they cause

thrashing during traditional backtracking search by redundantly

exploring symmetric parts of the search space. The topic was

discussed as far back as 1874 by Glaisher, and new techniques to

detect and/or break symmetry have been proposed in recent years.

However, many outstanding problems remain. For instance, the

detection and exploitation of local, dynamic, and weak forms of

symmetry remains a challenge.

The workshop is a forum for researchers to present advances in

symmetry breaking techniques and to discuss the above or other open

problems. Additionally, the workshop welcomes the presentation of

applications and case studies that exhibit some form of symmetry. The

workshop is relevant to the computational group theory (CGT) community

because CGT is often the theory underlying many symmetry breaking

techniques. Importantly, the organizers welcome submissions from

researchers working in other areas of Artificial Intelligence who feel

that their work would be of interest to the CP community. Such areas

include planning, model checking, QBF formulas, finite model search,

and theorem proving in FOL.

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

ATTENDANCE

----------

The workshop is open to all members of the CP community. At least one

author of each submission accepted for presentation must attend the

worksh

================================================================

Call for Papers

SymCon'07

The Seventh International Workshop

on Symmetry and Constraint Satisfaction Problems

(http://www.cmi.univ-mrs.fr/~benhamou/symcon07/)

To be held at the Thirteenth International Conference

on Principles and Practice of Constraint Programming (CP 2007)

Providence, RI, USA

September 23rd 2007

================================================================

WORKSHOP DESCRIPTION

--------------------

SymCon'07 is the 7th in a series of workshops affiliated with the CP

conference, and focuses on the investigation of symmetry and symmetry

breaking techniques for Constraint Satisfaction Problems (CSPs).

Symmetries occur frequently in CSPs. When undetected, they cause

thrashing during traditional backtracking search by redundantly

exploring symmetric parts of the search space. The topic was

discussed as far back as 1874 by Glaisher, and new techniques to

detect and/or break symmetry have been proposed in recent years.

However, many outstanding problems remain. For instance, the

detection and exploitation of local, dynamic, and weak forms of

symmetry remains a challenge.

The workshop is a forum for researchers to present advances in

symmetry breaking techniques and to discuss the above or other open

problems. Additionally, the workshop welcomes the presentation of

applications and case studies that exhibit some form of symmetry. The

workshop is relevant to the computational group theory (CGT) community

because CGT is often the theory underlying many symmetry breaking

techniques. Importantly, the organizers welcome submissions from

researchers working in other areas of Artificial Intelligence who feel

that their work would be of interest to the CP community. Such areas

include planning, model checking, QBF formulas, finite model search,

and theorem proving in FOL.

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

ATTENDANCE

----------

The workshop is open to all members of the CP community. At least one

author of each submission accepted for presentation must attend the

worksh

1. CFP: MICAI-2005 Artificial Intelligence, Springer LNAI: one week submission reminder and CFP

2. CFP: MICAI-2005 Artificial Intelligence, Springer LNAI: submission reminder and CFP-2

4. Reminder - CFP: ANTS 2004 - Call for Papers

7. CFP: Reminder of K-CAP 2007 WORKSHOP: Knowledge Capture and Constraint Programming (KCCP-07)

8. CFP reminder for SMART'11 @ CGO'11: paper submission deadline in less than a week

9. CfP Reminder: The Second Scala Workshop - Scala Days 2011

10. CFP reminder: SMART'08 - TWO WEEKS to Submission Deadline - November 2nd, 2007

12. CFP Reminder: World Congress on Engineering and Computer Science (WCECS 2007)

2 post • Page:**1** of **1**