Constraint Solving in Uncertain and Dynamic Environments: A Survey
暂无分享,去创建一个
[1] Kenneth N. Brown,et al. Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes , 2000, CP.
[2] Bertrand Neveu,et al. Maintaining arc consistency through constraint retraction , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.
[3] Gérard Ferrand,et al. Correctness of Constraint Retraction Algorithms , 2003, FLAIRS.
[4] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[5] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[6] Bjørn N. Freeman-Benson,et al. Multi‐way versus one‐way constraints in user interfaces: Experience with the deltablue algorithm , 1993, Softw. Pract. Exp..
[7] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[8] J. Christopher Beck,et al. Slack-based Techniques for Robust Schedules , 2014 .
[9] Pierre Marquis,et al. Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..
[10] John L. Bresina,et al. Just-In-Case Scheduling , 1994, AAAI.
[11] Thomas Schiex,et al. Mixed Constraint Satisfaction: A Framework for Decision Problems under Incomplete Knowledge , 1996, AAAI/IAAI, Vol. 1.
[12] Narendra Jussien,et al. The PaLM system: explanation-based constraint programming , 2000 .
[13] Thomas Schiex,et al. Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.
[14] V. N. Rao,et al. Solving constraint satisfaction problems using finite state automata , 1992, AAAI 1992.
[15] J. Dekleer. An assumption-based TMS , 1986 .
[16] Monte Zweben,et al. Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..
[17] Eugene C. Freuder,et al. Greater Efficiency for Conditional Constraint Satisfaction , 2003, CP.
[18] Kenneth N. Brown,et al. Branching Constraint Satisfaction Problems and Markov Decision Problems Compared , 2003, Ann. Oper. Res..
[19] Jan Maluszynski,et al. Analysis and Visualization Tools for Constraint Programming , 2000, Lecture Notes in Computer Science.
[20] Bjørn N. Freeman-Benson,et al. Ultraviolet: A Constraint Satisfaction Algorithm for Interactive Graphics , 1998, Constraints.
[21] Eugene C. Freuder,et al. Stable Solutions for Dynamic Constraint Satisfaction Problems , 1998, CP.
[22] Francesca Rossi,et al. Constraint Retraction in CLP(FD): Formal Framework and Performance Results , 1999, Constraints.
[23] Jérôme Lang,et al. Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.
[24] Eugene C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.
[25] Narendra Jussien,et al. Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..
[26] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[27] Romuald Debruyne,et al. Les algorithmes d'arc-consistance dans les CSP dynamiques , 1995 .
[28] Eugene C. Freuder,et al. Detecting and resolving inconsistency and redundancy in conditional constraint satisfaction problems , 1999, AAAI 1999.
[29] Richard E. Neapolitan,et al. Probabilistic reasoning in expert systems - theory and algorithms , 2012 .
[30] James Bowen,et al. Conditional Existence of Variables in Generalised Constraint Networks , 1991, AAAI.
[31] Ilkka Niemelä,et al. A Fixpoint Definition of Dynamic Constraint Satisfaction , 1999, CP.
[32] Patrice Boizumault,et al. Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.
[33] Nageshwara Rao Vempaty. Solving Constraint Satisfaction Problems Using Finite State Automata , 1992, AAAI.
[34] Christian Bessiere,et al. Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.
[35] François Fages,et al. Experiments in Reactive Constraint Logic Programming , 1998, J. Log. Program..
[36] A. Bellicha. Maintenance Of Solution In A DynamicConstraint Satisfaction Problem , 1970 .
[37] Stephen F. Smith,et al. Reactive Scheduling Systems , 1995 .
[38] Craig Boutilier,et al. Stochastic dynamic programming with factored representations , 2000, Artif. Intell..
[39] Rob Sherwood,et al. Using Iterative Repair to Improve the Responsiveness of Planning and Scheduling , 2000, AIPS.
[40] Rina Dechter,et al. Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.
[41] Thomas Schiex,et al. Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.
[42] Alan K. Mackworth. Constraint Satisfaction , 1985 .
[43] Narendra Jussien,et al. Stable solutions for dynamic project scheduling problems , 2004 .
[44] Eric Monfroy,et al. Beyond NP: Arc-Consistency for Quantified Constraints , 2002, CP.
[45] Nicola Muscettola,et al. Reformulating Temporal Plans for Efficient Execution , 1998, KR.
[46] Patrick Prosser,et al. A Reactive Scheduling Agent , 1989, IJCAI.
[47] Thomas Schiex,et al. Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.
[48] Emmanuel Hebrard,et al. Super Solutions in Constraint Programming , 2004, CPAIOR.
[49] RICHARD J. WALLACE,et al. Supporting dispatchability in schedules with consumable resources , 2005, J. Sched..
[50] Mark Wallace,et al. Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.
[51] P. Pandurang Nayak,et al. Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..
[52] Richard E. Neapolitan,et al. Probabilistic reasoning in expert systems - theory and algorithms , 2012 .
[53] Francesca Rossi,et al. Constraint Solving and Programming: What Next? , 1997, Constraints.
[54] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..
[55] Toby Walsh,et al. Stochastic Constraint Programming , 2002, ECAI.
[56] Gilles Trombettoni. A Polynomial Time Local Propagation Algorithm for General Dataflow Constraint Problems , 1998, CP.
[57] Thierry Vidal,et al. Handling contingency in temporal constraint networks: from consistency to controllabilities , 1999, J. Exp. Theor. Artif. Intell..
[58] Barry O'Sullivan. Interactive constraint-aided conceptual design , 2002, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.
[59] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[60] Yongping Ran. Approaches to Find a Near-minimal Change Solution for Dynamic CSPs , 2002 .
[61] Matthew L. Ginsberg,et al. Supermodels and Robustness , 1998, AAAI/IAAI.
[62] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..
[63] erard Verfaillie. Dynamic Backtracking for Dynamic Constraint Satisfaction Problems , 1994 .
[64] Romuald Debruyne,et al. Arc-consistency in dynamic CSPs is no more prohibitive , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.
[65] Jon Doyle,et al. A Truth Maintenance System , 1979, Artif. Intell..
[66] Thomas Schiex,et al. Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).
[67] Rachid Alami,et al. An Architecture for Autonomy , 1998, Int. J. Robotics Res..
[68] Nicola Muscettola,et al. Dynamic Control Of Plans With Temporal Uncertainty , 2001, IJCAI.
[69] G. Verfaillie,et al. Maintien de solution dans les problèmes dynamiques de satisfaction de contraintes : bilan de quelques approches , 1995 .
[70] Bjørn N. Freeman-Benson,et al. An incremental constraint solver , 1990, CACM.
[71] Rina Dechter,et al. Hybrid Processing of Beliefs and Constraints , 2001, UAI.
[72] Patrick Prosser,et al. A constraint maintenance system for the distributed resource allocation problem , 1992 .
[73] Boi Faltings,et al. Solving Mixed and Conditional Constraint Satisfaction Problems , 2003, Constraints.
[74] Christian Bessiere. Arc-Consistency for Non-Binary Dynamic CSPs , 1992, ECAI.
[75] Toniann Pitassi,et al. Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.
[76] Evelina Lamma,et al. Constraint Propagation and Value Acquisition: Why we should do it Interactively , 1999, IJCAI.
[77] Ian F. C. Smith,et al. Constraint-Based Support for Collaboration in Design and Construction , 1999 .
[78] Nicola Muscettola,et al. Execution of Temporal Plans with Uncertainty , 2000, AAAI/IAAI.
[79] Brian Falkenhainer,et al. Dynamic Constraint Satisfaction Problems , 1990, AAAI.
[80] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[81] Toby Walsh,et al. Scenario-based Stochastic Constraint Programming , 2009, IJCAI.
[82] Christophe Lecoutre. Constraint Networks , 1992 .
[83] Qiang Shen,et al. Fuzzy rrDFCSP and planning , 2003, Artif. Intell..
[84] Boi Faltings,et al. Open constraint programming , 2005, Artif. Intell..
[85] Peter van Beek,et al. CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.
[86] Eugene C. Freuder,et al. Configuration as Composite Constraint Satisfaction , 1996 .
[87] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..