Loading...
Please wait, while we are loading the content...
Similar Documents
Groups and Constraints: Symmetry Breaking during Search (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kelsey, Tom Gent, Ian P. Harvey, Warwick |
| Abstract | We present an interface between the ECL constraint logic programming system and the GAP computational abstract algebra system. The interface provides a method for eciently dealing with large numbers of symmetries of constraint satisfaction problems for minimal programming eort. We also report an implementation of SBDS using the GAP-ECL interface which is capable of handling many more symmetries than previous implementations and provides improved search performance for symmetric constraint satisfaction problems. |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Gap-ecl Interface Symmetric Constraint Satisfaction Problem Improved Search Performance Gap Computational Abstract Algebra System Minimal Programming Eort Ecl Constraint Logic Previous Implementation |
| Content Type | Text |