Consistency restoration and explanations in dynamic CSPs---Application to configuration

DOI10.1016/S0004-3702(01)00162-XzbMath0983.68182OpenAlexW2127845326MaRDI QIDQ5958543

Jérôme Amilhastre, Hélène Fargier, Pierre Marquis

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00162-x

zbMATH Keywords

compilationconstraint satisfaction problemassumptionsCSPsexplanationsinteractive configurationrestorations

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (18)

Progress towards the Holy Grail ⋮ Nature-inspired techniques for dynamic constraint satisfaction problems ⋮ Augmenting measure sensitivity to detect essential, dispensable and highly incompatible features in mass customization ⋮ Reformulation of global constraints based on constraints checkers ⋮ Computing and restoring global inverse consistency in interactive constraint satisfaction ⋮ Solution techniques for the large set covering problem ⋮ Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ LoCo—A Logic for Configuration Problems ⋮ On computing probabilistic abductive explanations ⋮ Complexity of minimum-size arc-inconsistency explanations ⋮ Mass Customization and “Forecasting Options’ Penetration Rates Problem” ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ Reformulating table constraints using functional dependencies-an application to explanation generation ⋮ On the Minimal Constraint Satisfaction Problem: Complexity and Generation ⋮ Pushing the frontier of minimality ⋮ STR3: a path-optimal filtering algorithm for table constraints ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns ⋮ Constraint solving in uncertain and dynamic environments: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree clustering for constraint networks
• Nonmonotonic reasoning: From complexity to algorithms
• Probabilistic Horn abduction and Bayesian networks
• Compiling constraint satisfaction problems
• Structure-driven algorithms for truth maintenance
• Graph-Based Algorithms for Boolean Function Manipulation
• The complexity of logic-based abduction
• Knowledge compilation and theory approximation

This page was built for publication: Consistency restoration and explanations in dynamic CSPs---Application to configuration