Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-guided-tour-of-artificial-intelligence-research-valued-constraint-fKJsD5wDl0
References (94)
-
Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham (2015)
Probabilistic Inference Based Message-Passing for Resource Constrained DCOPs -
Jimmy Lee, K. Leung (2009)
Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction -
S. Aji, R. McEliece (2000)
The generalized distributive lawIEEE Trans. Inf. Theory, 46
-
Martin Bresler, D. Prusa, Václav Hlaváč (2013)
Modeling Flowchart Structure Recognition as a Max-Sum Problem2013 12th International Conference on Document Analysis and Recognition
-
Christophe Lecoutre, L. Sais, Sébastien Tabary, V. Vidal (2006)
Last Conflict Based Reasoning -
Tomáš Werner (2007)
A Linear Programming Approach to Max-Sum Problem: A ReviewIEEE Transactions on Pattern Analysis and Machine Intelligence, 29
-
L. Shapiro, R. Haralick (1981)
Structural Descriptions and Inexact MatchingIEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-3
-
Martin Cooper, Sylvain Cussat-Blanc, Marie Roquemaurel, P. Régnier (2006)
Soft Arc Consistency Applied to Optimal Planning -
Radu Marinescu, R. Dechter (2007)
Best-First AND/OR Search for Most Probable Explanations -
Stefano Bistarelli, U. Montanari, F. Rossi (1995)
Constraint Solving over Semirings -
A. Rosenfeld, R. Hummel, S. Zucker (1976)
Scene Labeling by Relaxation OperationsIEEE Transactions on Systems, Man, and Cybernetics, 6
-
B. Hurley, B. O’Sullivan, D. Allouche, G. Katsirelos, T. Schiex, M. Zytnicki, S. Givry (2016)
Multi-language evaluation of exact solvers in graphical model discrete optimizationConstraints, 21
-
Stefano Ermon, C. Gomes, Ashish Sabharwal, B. Selman (2013)
Embed and Project: Discrete Sampling with Universal Hashing -
H. Papadopoulos, G. Tzanetakis (2013)
Exploiting structural relationships in audio music signals using Markov Logic Networks2013 IEEE International Conference on Acoustics, Speech and Signal Processing
-
G. Verfaillie, M. Lemaître, T. Schiex (1996)
Russian Doll Search for Solving Constraint Optimization Problems -
R. Dechter, I. Rish (2002)
Mini-buckets: a general scheme for approximating inference -
T. Schiex (1992)
Possibilistic Constraint Satisfaction Problems or "How to Handle Soft Constraints?" -
Johan Thapper, Stanislav Živný (2013)
The complexity of finite-valued CSPs -
P. Jeavons, A. Krokhin, Stanislav Živný (2014)
The Complexity of Valued Constraint SatisfactionBull. EATCS, 113
-
A. Favier, S. Givry, A. Legarra, T. Schiex (2011)
Pairwise Decomposition for Combinatorial Optimization in Graphical Models -
P. Meseguer, F. Rossi, T. Schiex (2000)
Soft Constraints -
H. Fargier, J. Lang, T. Schiex (1993)
Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems -
David Bergman, A. Ciré, W. Hoeve, J. Hooker (2015)
Decision diagrams for optimizationConstraints, 20
-
S. Givry, G. Katsirelos (2017)
Clique Cuts in Weighted Constraint Satisfaction -
Jimmy Lee, K. Leung (2014)
Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint SatisfactionArXiv, abs/1401.4605
-
Hiep Nguyen, C. Bessiere, S. Givry, T. Schiex (2016)
Triangle-based consistencies for cost function networksConstraints, 22
-
Martin Cooper, S. Givry, Martí Sánchez-Fibla, T. Schiex, M. Zytnicki (2008)
Virtual Arc Consistency for Weighted CSP -
U. Bertelè, F. Brioschi (1972)
Nonserial Dynamic Programming -
T. Schiex, H. Fargier, G. Verfaillie (1995)
Valued Constraint Satisfaction Problems: Hard and Easy Problems -
C. Pralet, G. Verfaillie, T. Schiex (2007)
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and UtilitiesArXiv, abs/1110.2741
-
E. Boros, P. Hammer (2002)
Pseudo-Boolean optimizationDiscret. Appl. Math., 123
-
D. Allouche, C. Bessiere, P. Boizumault, S. Givry, Patricia Gutierrez, S. Loudni, Jean-Philippe Métivier, T. Schiex (2012)
Filtering Decomposable Global Cost Functions -
Martin Cooper (2003)
Reduction operations in fuzzy or valued constraint satisfactionFuzzy Sets Syst., 134
-
B. Cabon, S. Givry, L. Lobjois, T. Schiex, J. Warners (1999)
Radio Link Frequency AssignmentConstraints, 4
-
S. Givry, S. Prestwich, B. O’Sullivan (2013)
Dead-End Elimination for Weighted CSP -
D. Allouche, S. Givry, T. Schiex (2010)
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP -
Radu Marinescu, R. Dechter (2005)
AND/OR Branch-and-Bound for Graphical Models -
Mathieu Fontaine, S. Loudni, P. Boizumault (2013)
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNSRAIRO Oper. Res., 47
-
Martin Cooper (2005)
High-Order Consistency in Valued Constraint SatisfactionConstraints, 10
-
D. Allouche, I. André, S. Barbe, Jessica Davies, S. Givry, G. Katsirelos, B. O’Sullivan, S. Prestwich, T. Schiex, S. Traoré (2014)
Computational protein design as an optimization problemArtif. Intell., 212
-
Adnan Darwiche, P. Marquis (2004)
Compiling propositional weighted basesArtif. Intell., 157
-
H. Papadopoulos, G. Tzanetakis (2012)
Modeling Chord and Key Structure with Markov Logic -
S. Loudni, P. Boizumault (2008)
Combining VNS with constraint programming for solving anytime optimization problemsEur. J. Oper. Res., 191
-
Y. Lee, Aaron Sidford, Sam Wong (2015)
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization2015 IEEE 56th Annual Symposium on Foundations of Computer Science
-
S. Givry, Jimmy Lee, K. Leung, Y. Shum (2014)
Solving a Judge Assignment Problem Using Conjunctions of Global Cost Functions -
D. Simoncini, D. Allouche, S. Givry, Céline Delmas, S. Barbe, T. Schiex (2015)
Guaranteed Discrete Energy Optimization on Large Protein Design Problems.Journal of chemical theory and computation, 11 12
-
Abdelkader Ouali, S. Loudni, Lakhdar Loukil, P. Boizumault, Yahia Lebbah (2015)
Replicated Parallel Strategies for Decomposition Guided VNSElectron. Notes Discret. Math., 47
-
R. Dechter (1997)
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning -
Nic Wilson (2005)
Decision Diagrams for the Computation of Semiring Valuations -
Article in Press a Unified Framework for Partial and Hybrid Search Methods in Constraint Programming -
B. Neveu, Gilles Trombettoni, F. Glover (2004)
ID Walk: A Candidate List Strategy with a Simple Diversification Device -
T. Schiex (2000)
Arc consistency for soft constraints -
D. Dubois, H. Prade (1990)
Inference in Possibilistic Hypergraphs -
Martin Cooper, S. Givry, T. Schiex (2007)
Optimal Soft Arc Consistency -
R. Dechter (1999)
Bucket Elimination: A Unifying Framework for ReasoningArtif. Intell., 113
-
Martin Cooper, S. Givry, Martí Sánchez-Fibla, T. Schiex, M. Zytnicki, Tomáš Werner (2010)
Soft arc consistency revisitedArtif. Intell., 174
-
F. Kschischang, B. Frey, Hans-Andrea Loeliger (2001)
Factor graphs and the sum-product algorithmIEEE Trans. Inf. Theory, 47
-
M. Zytnicki, C. Gaspin, T. Schiex (2008)
DARN! A Weighted Constraint Solver for RNA Motif LocalizationConstraints, 13
-
Jörg Kappes, Björn Andres, F. Hamprecht, C. Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard Kausler, Thorben Kröger, J. Lellmann, N. Komodakis, Bogdan Savchynskyy, C. Rother (2014)
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization ProblemsInternational Journal of Computer Vision, 115
-
M. Gondran, M. Minoux (2008)
Graphs, dioids and semirings : new models and algorithms, 41
-
Eugene Freuder, R. Wallace (1989)
Partial Constraint SatisfactionArtif. Intell., 58
-
H. Fargier, P. Marquis (2007)
On Valued Negation Normal Form Formulas -
P. Jeavons, Martin Cooper (1995)
Tractable Constraints on Ordered DomainsArtif. Intell., 79
-
R. Dechter (1995)
Constraint Processing -
Mahuna Akplogan, S. Givry, Jean-Philippe Métivier, G. Quesnel, A. Joannon, Frédérick Garçia (2013)
Solving the Crop Allocation Problem using Hard and Soft ConstraintsRAIRO Oper. Res., 47
-
C. Domshlak, F. Rossi, K. Venable, T. Walsh (2003)
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques -
Akshat Kumar, S. Zilberstein (2010)
Point-based backup for decentralized POMDPs: complexity and new algorithms -
S. Givry, T. Schiex, G. Verfaillie (2006)
Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP -
Stefano Bistarelli, U. Montanari, F. Rossi (1997)
Semiring-based constraint satisfaction and optimizationJ. ACM, 44
-
H. Fargier, J. Lang (1993)
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach -
Martí Sánchez-Fibla, S. Givry, T. Schiex (2007)
Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction TechniquesConstraints, 13
-
S. Givry, F. Heras, M. Zytnicki, J. Larrosa (2005)
Existential arc consistency: Getting closer to full arc consistency in weighted CSPs -
M. Gondran, M. Minoux (1995)
Graphes et algorithmes -
F. Esteva (2003)
Review of Triangular norms by E. P. Klement, R. Mesiar and E. Pap. Kluwer Academic PublishersInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 11
-
Érick Alphonse, C. Rouveirol (2007)
Extension of the Top-Down Data-Driven Strategy to ILP -
M. Zytnicki, C. Gaspin, T. Schiex (2007)
DARN! A soft constraint solver for RNA motif localization -
R. Dechter, I. Rish (2003)
Mini-buckets: A general scheme for bounded inferenceJ. ACM, 50
-
C. Terrioux, Philippe Jégou (2003)
Bounded Backtracking for the Valued Constraint Satisfaction Problems -
D. Allouche, C. Bessiere, P. Boizumault, S. Givry, Patricia Gutierrez, Jimmy Lee, K. Leung, S. Loudni, Jean-Philippe Métivier, T. Schiex, Yi Wu (2015)
Tractability-preserving transformations of global cost functionsArtif. Intell., 238
-
D. Mitchell (2003)
Resolution and Constraint Satisfaction -
M. Silberstein, O. Weissbrod, L. Otten, Anna Tzemach, Andrei Anisenia, O. Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, A. Shalata, Z. Borochowitz, R. Dechter, E. Thompson, D. Geiger (2013)
A system for exact and approximate genetic linkage analysis of SNP data in large pedigreesBioinformatics, 29 2
-
D. Allouche, S. Givry, G. Katsirelos, T. Schiex, M. Zytnicki (2015)
Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP -
R. Chellappa, Anil Jain (1993)
Markov random fields : theory and application -
J. Larrosa (2000)
Boosting Search with Variable Elimination -
P. Maier, Dominik Jain, M. Sachenbacher (2011)
Diagnostic Hypothesis Enumeration vs. Probabilistic Inference for Hierarchical Automata Models -
H. Bodlaender, A. Koster (2010)
Treewidth computations I. Upper boundsInf. Comput., 208
-
Abdelkader Ouali, D. Allouche, S. Givry, S. Loudni, Yahia Lebbah, Lakhdar Loukil (2017)
Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization -
F. Bacchus, Adam Grove (1995)
Graphical models for preference and utility -
J. Dibangoye, Chris Amato, O. Buffet, F. Charpillet (2013)
Optimally Solving Dec-POMDPs as Continuous-State MDPs -
D. Dubois, H. Fargier, H. Prade (1996)
Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertaintyApplied Intelligence, 6
-
A. Favier, J. Elsen, S. Givry, A. Legarra (2010)
Optimal haplotype reconstruction in half-sib families -
S. Traoré, D. Allouche, I. André, S. Givry, G. Katsirelos, T. Schiex, S. Barbe (2013)
A new framework for computational protein design through cost function network optimizationBioinformatics, 29 17
-
M. Zytnicki, C. Gaspin, S. Givry, T. Schiex (2009)
Bounds Arc Consistency for Weighted CSPsArXiv, abs/1401.3481
-
Martí Sánchez-Fibla, D. Allouche, S. Givry, T. Schiex (2009)
Russian Doll Search with Tree Decomposition
- Publisher
- Springer International Publishing
- Copyright
- © Springer Nature Switzerland AG 2020
- ISBN
- 978-3-030-06166-1
- Pages
- 185 –207
- DOI
- 10.1007/978-3-030-06167-8_7
- Publisher site
- See Chapter on Publisher Site
Abstract
[AsOptimisationdiscrete an extensionCooper, Martin C. of constraint networks, valued constraint networks (or valued CSPs) define a unifyingDe Givry, Simon framework for modelling optimisation problems over finite domains in which the cost domain (also denoted as the valuation structure) can be symbolic or numeric but is totally ordered. As is the case for constraint networks, valued CSPs can be viewedSchiex, Thomas as graphical models, defined by a set of variables with an associated finite domain and by a set of cost functions, each involving a subset of the variables. Before reading this chapter, we strongly advise the reader to finish reading chapter “Constraint Reasoning” of this Volume, dedicated to the Constraint Satisfaction Problem.]
Published: May 8, 2020