article

Network-based heuristics for constraint-satisfaction problems

Authors:

R. Dechter,

J. PearlAuthors Info & Claims

Artificial Intelligence, Volume 34, Issue 1

Pages 1 - 38

https://doi.org/10.1016/0004-3702(87)90002-6

Published: 01 December 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Liu RNatarajan MGombolay M(2021)Coordinating Human-Robot Teams with Dynamic and Stochastic Task ProficienciesACM Transactions on Human-Robot Interaction10.1145/347739111:1(1-42)Online publication date: 18-Oct-2021
https://dl.acm.org/doi/10.1145/3477391
Anselma LMazzei APiovesan LTerenziani P(2021)Reasoning and querying bounds on differences with layered preferencesInternational Journal of Intelligent Systems10.1002/int.2236936:5(1998-2035)Online publication date: 13-Feb-2021
https://dl.acm.org/doi/10.1002/int.22369
Tveretina OZaichenkov PShafarenko A(2020)Non-local configuration of component interfaces by constraint satisfactionConstraints10.1007/s10601-020-09309-y25:3-4(121-159)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s10601-020-09309-y
Show More Cited By

Index Terms

Network-based heuristics for constraint-satisfaction problems

Recommendations

Integrating heuristics for constraint satisfaction problems: a case study
AAAI'93: Proceedings of the eleventh national conference on Artificial intelligence

This paper describes a set of experiments with a system that synthesizes constraint satisfaction programs. The system, MULTI-TAC, is a CSP "expert" that can specialize a library of generic algorithms and methods for a particular application. MULTI-TAC ...
Heuristics for Solving Fuzzy Constraint Satisfaction Problems
ANNES '95: Proceedings of the 2nd New Zealand Two-Stream International Conference on Artificial Neural Networks and Expert Systems

Work in the field of AI over the past twenty years has shown that many problems can be represented as constraint satisfaction problems and efficiently solved by constraint satisfaction algorithms. However, constraint satisfaction in its pure form isn't ...
Experimental matching of instances to heuristics for constraint satisfaction problems

Constraint satisfaction problems are of special interest for the artificial intelligence and operations research community due to their many applications. Although heuristics involved in solving these problems have largely been studied in the past, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Artificial Intelligence Volume 34, Issue 1

Dec. 1987

113 pages

ISSN:0004-3702

Editor:
Daniel G. Bobrow
Xerox Palo Alto Research Center, Palo Alto, CA

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 December 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

184
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu RNatarajan MGombolay M(2021)Coordinating Human-Robot Teams with Dynamic and Stochastic Task ProficienciesACM Transactions on Human-Robot Interaction10.1145/347739111:1(1-42)Online publication date: 18-Oct-2021
https://dl.acm.org/doi/10.1145/3477391
Anselma LMazzei APiovesan LTerenziani P(2021)Reasoning and querying bounds on differences with layered preferencesInternational Journal of Intelligent Systems10.1002/int.2236936:5(1998-2035)Online publication date: 13-Feb-2021
https://dl.acm.org/doi/10.1002/int.22369
Tveretina OZaichenkov PShafarenko A(2020)Non-local configuration of component interfaces by constraint satisfactionConstraints10.1007/s10601-020-09309-y25:3-4(121-159)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s10601-020-09309-y
Jguirim WNaanaa WCooper M(2018)A polynomial relational class of binary CSPAnnals of Mathematics and Artificial Intelligence10.1007/s10472-017-9566-683:1(1-20)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s10472-017-9566-6
Derenievicz GSilva F(2018)Epiphytic Trees: Relational Consistency Applied to Global Optimization ProblemsIntegration of Constraint Programming, Artificial Intelligence, and Operations Research10.1007/978-3-319-93031-2_11(153-169)Online publication date: 26-Jun-2018
https://dl.acm.org/doi/10.1007/978-3-319-93031-2_11
Lee JZhu Z(2016)Breaking more composition symmetries using search heuristicsProceedings of the Thirtieth AAAI Conference on Artificial Intelligence10.5555/3016100.3016383(3418-3425)Online publication date: 12-Feb-2016
https://dl.acm.org/doi/10.5555/3016100.3016383
Carbonnel CCooper M(2016)Tractability in constraint satisfaction problemsConstraints10.1007/s10601-015-9198-621:2(115-144)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s10601-015-9198-6
Ujhelyi ZBergmann GHegedüs ÁHorváth ÁIzsó BRáth ISzatmári ZVarró D(2015)EMF-IncQueryScience of Computer Programming10.1016/j.scico.2014.01.00498:P1(80-99)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.01.004
Felbinger HSchwarzl CGanesh VWilliams N(2014)Suitability analysis of CSP- and SMT-solvers for test case generationProceedings of the 6th International Workshop on Constraints in Software Testing, Verification, and Analysis10.1145/2593735.2593741(40-49)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2593735.2593741
Dilkina BGomes CSabharwal A(2014)Tradeoffs in the complexity of backdoors to satisfiabilityAnnals of Mathematics and Artificial Intelligence10.1007/s10472-014-9407-970:4(399-431)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1007/s10472-014-9407-9
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Integrating heuristics for constraint satisfaction problems: a case study

Heuristics for Solving Fuzzy Constraint Satisfaction Problems

Experimental matching of instances to heuristics for constraint satisfaction problems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations