The ARGMAX Constraint

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

TheARGMAX function returns the index of the (first copy of the) maximum value occuring in a list of values. ARGMAX is important in models where we choose a characteristic value based on a seperate criteria, and for modelling neural networks which make use of ARGMAX in their definition. The ARGMAX constraint has been studied for the special case of its use to find the index of the first true in a list of Booleans, since this is useful for encoding if-then-else chains. Here we examine the general argmax constraint for the first time. We define an efficient domain consistent propagator and a decomposition for integers which implements domain consistency.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication26th International Conference, CP 2020 Louvain-la-Neuve, Belgium, September 7–11, 2020 Proceedings
EditorsHelmut Simonis
Place of PublicationCham Switzerland
PublisherSpringer
Pages323-337
Number of pages15
ISBN (Electronic)9783030584757
ISBN (Print)9783030584740
DOIs
Publication statusPublished - 2020
EventInternational Conference on Principles and Practice of Constraint Programming 2020 - Louvain-la-Neuve, Belgium
Duration: 7 Sep 202011 Sep 2020
Conference number: 26th
https://link.springer.com/book/10.1007/978-3-030-58475-7 (Proceedings)
https://cp2020.a4cp.org (Website)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12333
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Principles and Practice of Constraint Programming 2020
Abbreviated titleCP2020
Country/TerritoryBelgium
CityLouvain-la-Neuve
Period7/09/2011/09/20
Internet address

Cite this