| 1. |
- Barnes, Nick, et al.
(författare)
-
AI@NICTA
- 2012
-
Ingår i: The AI Magazine. - 0738-4602. ; 33:3, s. 115-127
-
Tidskriftsartikel (refereegranskat)abstract
- NICTA is Australia's Information and Communications Technology (ICT) Centre of Excellence. It is the largest organization in Australia dedicated to ICT research. While it has close links with local universities, it is in fact an independent but not-for-profit company in the business of doing research, commercializing that research and training Ph.D. students to do that research. Much of the work taking place at NICTA involves various topics in artificial intelligence. In this article, we survey some of the AI work being undertaken at NICTA.
|
|
| 2. |
- Beldiceanu, Nicolas, et al.
(författare)
-
Propagating regular counting constraints
- 2014
-
Ingår i: Proc. 28th AAAI Conference on Artificial Intelligence. - Palo Alto, CA : AAAI Press. - 9781577356806 ; , s. 2616-2622
-
Konferensbidrag (refereegranskat)
|
|
| 3. |
|
|
| 4. |
- Flener, Pierre, et al.
(författare)
-
Efficient structural symmetry breaking for constraint satisfaction problems
- 2007. - 1
-
Ingår i: Proceedings of the International Symmetry Conference, Edinburgh, UK.
-
Konferensbidrag (refereegranskat)abstract
- Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various forms of value and variable interchangeability is tractable using dedicated search procedures or symmetry-breaking constraints that allow nogoods and their symmetrically equivalent solutions to be stored and checked efficiently.
|
|
| 5. |
|
|
| 6. |
- Flener, Pierre, et al.
(författare)
-
Static and dynamic structural symmetry breaking
- 2006
-
Ingår i: Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06). - Berlin, Heidelberg : Springer Berlin Heidelberg.
-
Konferensbidrag (refereegranskat)
|
|
| 7. |
- Hentenryck, Pascal Van, et al.
(författare)
-
Compositional Derivation of Symmetries for Constraint Satisfaction
- 2004
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the applications from primitive constraints. Its key insight is the recognition of the special role of global constraints in symmetry detection. Once the symmetries of global constraints are available, it often becomes much easier to derive symmetries compositionally and efficiently. The paper demonstrates the potential of this approach by studying several classes of value and variable symmetries and applying the resulting techniques to two non-trivial applications. The paper also discusses the potential of reformulations and high-level modelling abstractions to strengthen symmetry discovery.
|
|
| 8. |
- Michel, Laurent, et al.
(författare)
-
Constraint Programming Tools
- 2007
-
Ingår i: Trends in Constraint Programming. - London, UK : IST Press. ; , s. 41-57
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 9. |
- Van Hentenryck, Pascal, et al.
(författare)
-
Compositional derivation of symmetries for constraint satisfaction
- 2005
-
Ingår i: Abstraction, Reformulation and Approximation. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 3540278729 ; , s. 234-247, s. 234-247
-
Konferensbidrag (refereegranskat)abstract
- This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the applications from primitive constraints. The key insight is the recognition of the special role of global constraints in symmetry detection. Once the symmetries of global constraints are available, it often becomes much easier to derive symmetries compositionally and efficiently. The paper demonstrates the potential of this approach by studying several classes of value and variable symmetries and applying the resulting techniques to two non-trivial applications. The paper also discusses the potential of reformulations and high-level modeling abstractions to strengthen symmetry discovery.
|
|
| 10. |
- Van Hentenryck, Pascal, et al.
(författare)
-
Tractable symmetry breaking for CSPs with interchangeable values.
- 2003
-
Ingår i: Proceedings of the eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003). - : Morgan Kaufmann. ; , s. 277-282, s. 277-282
-
Konferensbidrag (refereegranskat)abstract
- Symmetry breaking in CSPs has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries during search. In general, these schemes may take exponential space or time to eliminate all symmetries. This paper studies classes of CSPs for which symmetry breaking is tractable. It identifies several CSP classes which feature various forms of value interchangeability and shows that symmetry breaking can be performed in constant time and space during search using dedicated search procedures. Experimental results also show the benefits of symmetry breaking on these CSPs, which encompass many practical applications.
|
|
