skip to main content
10.1145/2480362.2480382acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Many-to-many interchangeable sets of values in CSPs

Published: 18 March 2013 Publication History

Abstract

Onto-substitutability has been shown to be intrinsic to how a domain value is considered redundant. A value is onto-substitutable if any solution involving that value remains a solution when that value is replaced by some other value. We redefine onto-substitutability to accommodate binary relationships and study its implication. Joint interchangeability, an extension of onto-substitutability to its interchangeability counterpart, emerges as one of the results. We propose a new way of removing interchangeable values by constructing a new value as an intermediate step, as well as introduce virtual interchangeability, a local reasoning that leads to joint interchangeability and allows values to be merged together.

References

[1]
F. Bacchus, X. Chen, P. van Beek, and T. Walsh. Binary vs. non-binary constraints. AIJ, 140(1--2):1--37, 2002.
[2]
L. Bordeaux, M. Cadoli, and T. Mancini. A unifying framework for structural properties of CSPs: Definitions, complexity, tractability. JAIR, 32:607--629, 2008.
[3]
J. Bowen and C. Likitvivatanavong. Domain transmutation in constraint satisfaction problems. In Proc. of AAAI-04.
[4]
M. C. Cooper and G. Escamoche. A dichotomy for 2-constraint forbidden CSP patterns. In Proc. of AAAI-12.
[5]
M. C. Cooper, P. G. Jeavons, and A. Z. Salamon. Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. AIJ, 9--10(174):570--584, 2010.
[6]
E. C. Freuder. Dispensable instantiations. In CP-11 Workshop on Constraint Modelling and Reformulation.
[7]
E. C. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI-91.
[8]
A. Haselböck. Exploiting interchangeabilities in constraint satisfaction problems. In Proc. of IJCAI-93, pages 282--287.
[9]
S. Karakashian, R. Woodward, B. Y. Choueiry, S. Prestwich, and E. C. Freuder. A partial taxonomy of substitutability and interchangeability. In CP-10 Workshop on Symmetry in Constraint Satisfaction Problems, 2010.
[10]
G. Katsirelos and T. Walsh. A compression algorithm for large arity extensional constraints. In Proc. of CP-07.
[11]
A. Lal, B. Y. Choueiry, and E. C. Freuder. Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs. In Proceedings of AAAI-05, pages 397--404.
[12]
C. Likitvivatanavong and R. H. C. Yap. A refutation approach to neighborhood interchangeability in CSPs. In Proc. of Australasian Joint Conference on AI, 2008.
[13]
N. Samaras and K. Stergiou. Binary encoding of non-binary constraint satisfaction problems: Algorithms and experimental results. JAIR, 24:641--684, 2005.
[14]
R. Weigel, B. V. Faltings, and B. Y. Choueiry. Context in discrete constraint satisfaction problems. In Proceedings of ECAI-96, pages 205--213, Budapest, Hungary, 1996.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
March 2013
2124 pages
ISBN:9781450316569
DOI:10.1145/2480362
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 March 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. constraint satisfaction problems
  2. interchangeability

Qualifiers

  • Research-article

Conference

SAC '13
Sponsor:
SAC '13: SAC '13
March 18 - 22, 2013
Coimbra, Portugal

Acceptance Rates

SAC '13 Paper Acceptance Rate 255 of 1,063 submissions, 24%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Strengthening Neighbourhood SubstitutionPrinciples and Practice of Constraint Programming10.1007/978-3-030-58475-7_8(126-142)Online publication date: 2-Sep-2020
  • (2018)On a new extension of BTP for binary CSPsConstraints10.1007/s10601-018-9290-923:4(355-382)Online publication date: 1-Oct-2018
  • (2017)A BTP-based family of variable elimination rules for binary CSPsProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298131(3871-3877)Online publication date: 4-Feb-2017
  • (2016)Extending Broken Triangles and Enhanced Value-MergingPrinciples and Practice of Constraint Programming10.1007/978-3-319-44953-1_12(173-188)Online publication date: 23-Aug-2016

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media