%0 Conference Paper %F Oral %T If We Take Into Account that Constraints Are Soft,Then Processing Constraints BecomesAlgorithmically Solvable %+ École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne) %+ Lab-STICC_ENSTAB_CID_IHSEV ; OSM %+ Département STIC [Brest] (STIC) %+ Laboratoire d'Informatique de Nantes Atlantique (LINA) %+ Department of Computer Science %A Brefort, Quentin %A Jaulin, Luc %A Ceberio, Martine %A Kreinovich, Vladik %< avec comité de lecture %B SSCI 2014 %C Orlando, United States %8 2014-12-09 %D 2014 %K Underwater robot %K localization %K signal processing %Z Engineering Sciences [physics]/Automatic %Z Engineering Sciences [physics]/Signal and Image processingConference papers %X Constraints are ubiquitous in science and engineering.Constraints describe the available information aboutthe state of the system, constraints describe possible relationbetween current and future states of the system, constraintsdescribe which future states we would like to obtain. To solveproblems from engineering and science, it is therefore necessaryto process constraints. We show that if we treat constraints ashard (crisp), with all the threshold values exactly known, then inthe general case, all the corresponding computational problemsbecome algorithmically unsolvable. However, these problemsbecome algorithmically solvable if we take into account that inreality, constraints are soft: we do not know the exact values of thecorresponding thresholds, we do not know the exact dependencebetween the present and future states, etc. %G English %L hal-01122062 %U https://hal.science/hal-01122062 %~ UNIV-NANTES %~ ENSTA-BRETAGNE %~ CNRS %~ LINA %~ ENSTA-BRETAGNE-STIC %~ LAB-STICC %~ TDS-MACS %~ NANTES-UNIVERSITE %~ UNIV-NANTES-AV2022