Constraint solving in uncertain and dynamic environments: A survey
type: Item
instance of: scholarly article
title: Constraint solving in uncertain and dynamic environments: A survey
zbMATH Open document ID: 1086.68595
author: Gérard Verfaillie
author: Narendra Jussien
published in: Constraints
publication date: 2006-02-23T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5009061
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: uncertainty
zbMATH Keywords: change
zbMATH Keywords: stability
zbMATH Keywords: robustness
zbMATH Keywords: flexibility
describes a project that uses: CPlan
MaRDI profile type: Publication
full work available at URL: s10601-005-2239-9
OpenAlex ID: W1987789460
cites work: Consistency restoration and explanations in dynamic CSPs---Application to configuration
cites work: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
cites work: Ultraviolet: A constraint satisfaction algorithm for interactive graphics
cites work: Stochastic dynamic programming with factored representations
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Temporal constraint networks
cites work: Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14].1
cites work: Open constraint programming
cites work: Q4473050
cites work: Branching constraint satisfaction problems and Markov decision problems compared
cites work: Solving mixed and conditional constraint satisfaction problems
cites work: Constraint retraction in CLP(FD): Formal framework and performance results
cites work: Q4386920
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Q3357523
cites work: Local search with constraint propagation and conflict-based heuristics
cites work: Q4473030
cites work: Stochastic Boolean satisfiability
cites work: The logic of constraint satisfaction
cites work: Stochastic constraint programming: A scenario-based approach
cites work: Fuzzy \(rr\)DFCSP and planning
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: Remote Agent: to boldly go where no AI system has gone before
cites work: Q3997653
cites work: Q3198911
cites work: Q4315289
cites work: Probe backtrack search for minimal perturbation in dynamic scheduling
cites work: Handling contingency in temporal constraint networks: from consistency to controllabilities
cites work: Supporting dispatchability in schedules with consumable resources
DOI: 10.1007/S10601-005-2239-9
description: scientific article; zbMATH DE number 5009061