Soft nonlinearity constraints and their lower-arity decomposition

Venkatesh Ramamoorthy, Marius C. Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo

Research output: Contribution to conferencePaper

Abstract

In this paper we express nonlinearity requirements in terms of soft global n-ary constraints. We describe a method to project global nonlinearity constraints into redundant lowerarity hard constraints. The nonlinearity constraints apply to the inputs and outputs of discrete functions f : ℤ2n → ℤ2m mapping n-bit inputs to m-bit outputs, n > m. No output bit (or linear function on a subset of output bits) of the function f should be too close to a linear function of (a subset of) its input bits. For example, if we select any output bit position and any subset of the six input bit positions, the fraction of inputs for which this output bit equals the exclusive-OR of these input bits should not be close to 0 or 1, but rather should be near 1/2. We analyze this constraint and find that the obtained redundant constraints increase the efficiency of an arc consistency maintenance solver by several orders of magnitude.

Original languageEnglish
Publication statusPublished - Dec 1 2012
EventInternational Symposium on Artificial Intelligence and Mathematics, ISAIM 2012 - Fort Lauderdale, FL, United States
Duration: Jan 9 2012Jan 11 2012

Other

OtherInternational Symposium on Artificial Intelligence and Mathematics, ISAIM 2012
CountryUnited States
CityFort Lauderdale, FL
Period1/9/121/11/12

Fingerprint

Nonlinearity
Decomposition
Decompose
Output
Linear Function
Subset
Set theory
Maintenance
Arc of a curve
Express
Requirements

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Applied Mathematics

Cite this

Ramamoorthy, V., Silaghi, M. C., Matsui, T., Hirayama, K., & Yokoo, M. (2012). Soft nonlinearity constraints and their lower-arity decomposition. Paper presented at International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, FL, United States.

Soft nonlinearity constraints and their lower-arity decomposition. / Ramamoorthy, Venkatesh; Silaghi, Marius C.; Matsui, Toshihiro; Hirayama, Katsutoshi; Yokoo, Makoto.

2012. Paper presented at International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, FL, United States.

Research output: Contribution to conferencePaper

Ramamoorthy, V, Silaghi, MC, Matsui, T, Hirayama, K & Yokoo, M 2012, 'Soft nonlinearity constraints and their lower-arity decomposition', Paper presented at International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, FL, United States, 1/9/12 - 1/11/12.
Ramamoorthy V, Silaghi MC, Matsui T, Hirayama K, Yokoo M. Soft nonlinearity constraints and their lower-arity decomposition. 2012. Paper presented at International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, FL, United States.
Ramamoorthy, Venkatesh ; Silaghi, Marius C. ; Matsui, Toshihiro ; Hirayama, Katsutoshi ; Yokoo, Makoto. / Soft nonlinearity constraints and their lower-arity decomposition. Paper presented at International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, FL, United States.
@conference{7dba106d5e7b49879363ad2271ad9e2d,
title = "Soft nonlinearity constraints and their lower-arity decomposition",
abstract = "In this paper we express nonlinearity requirements in terms of soft global n-ary constraints. We describe a method to project global nonlinearity constraints into redundant lowerarity hard constraints. The nonlinearity constraints apply to the inputs and outputs of discrete functions f : ℤ2n → ℤ2m mapping n-bit inputs to m-bit outputs, n > m. No output bit (or linear function on a subset of output bits) of the function f should be too close to a linear function of (a subset of) its input bits. For example, if we select any output bit position and any subset of the six input bit positions, the fraction of inputs for which this output bit equals the exclusive-OR of these input bits should not be close to 0 or 1, but rather should be near 1/2. We analyze this constraint and find that the obtained redundant constraints increase the efficiency of an arc consistency maintenance solver by several orders of magnitude.",
author = "Venkatesh Ramamoorthy and Silaghi, {Marius C.} and Toshihiro Matsui and Katsutoshi Hirayama and Makoto Yokoo",
year = "2012",
month = "12",
day = "1",
language = "English",
note = "International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012 ; Conference date: 09-01-2012 Through 11-01-2012",

}

TY - CONF

T1 - Soft nonlinearity constraints and their lower-arity decomposition

AU - Ramamoorthy, Venkatesh

AU - Silaghi, Marius C.

AU - Matsui, Toshihiro

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

PY - 2012/12/1

Y1 - 2012/12/1

N2 - In this paper we express nonlinearity requirements in terms of soft global n-ary constraints. We describe a method to project global nonlinearity constraints into redundant lowerarity hard constraints. The nonlinearity constraints apply to the inputs and outputs of discrete functions f : ℤ2n → ℤ2m mapping n-bit inputs to m-bit outputs, n > m. No output bit (or linear function on a subset of output bits) of the function f should be too close to a linear function of (a subset of) its input bits. For example, if we select any output bit position and any subset of the six input bit positions, the fraction of inputs for which this output bit equals the exclusive-OR of these input bits should not be close to 0 or 1, but rather should be near 1/2. We analyze this constraint and find that the obtained redundant constraints increase the efficiency of an arc consistency maintenance solver by several orders of magnitude.

AB - In this paper we express nonlinearity requirements in terms of soft global n-ary constraints. We describe a method to project global nonlinearity constraints into redundant lowerarity hard constraints. The nonlinearity constraints apply to the inputs and outputs of discrete functions f : ℤ2n → ℤ2m mapping n-bit inputs to m-bit outputs, n > m. No output bit (or linear function on a subset of output bits) of the function f should be too close to a linear function of (a subset of) its input bits. For example, if we select any output bit position and any subset of the six input bit positions, the fraction of inputs for which this output bit equals the exclusive-OR of these input bits should not be close to 0 or 1, but rather should be near 1/2. We analyze this constraint and find that the obtained redundant constraints increase the efficiency of an arc consistency maintenance solver by several orders of magnitude.

UR - http://www.scopus.com/inward/record.url?scp=84885802386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885802386&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84885802386

ER -