Dynamic Flexible Constraint Satisfaction and its Application to AI Planning

dynamic flexible constraint satisfaction and its application to ai planning are a good way to achieve details about operating certainproducts. Many products that you buy can be obtained using instruction manuals. These user guides are clearlybuilt to give step-by-step information about how you ought to go ahead in operating certain equipments. Ahandbook is really a user's guide to operating the equipments. Should you loose your best guide or even the productwould not provide an instructions, you can easily obtain one on the net. You can search for the manual of yourchoice online. Here, it is possible to work with google to browse through the available user guide and find the mainone you'll need. On the net, you'll be able to discover the manual that you might want with great ease andsimplicity

[1]  Benjamin Kuipers,et al.  A Compositional Modeling Language , 1996 .

[2]  Robert P. Goldman,et al.  Epsilon-Safe Planning , 1994, UAI.

[3]  Johan de Kleer,et al.  A Comparison of ATMS and CSP Techniques , 1989, IJCAI.

[4]  Philippe Baptiste,et al.  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems , 1997, CP.

[5]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[6]  Qiang Shen,et al.  Extending Qualitative Modelling for Simulation of Time-Delayed Behaviour , 1998 .

[7]  Maurice Bruynooghe,et al.  Solving Combinatorial Search Problems by Intelligent Backtracking , 1981, Inf. Process. Lett..

[8]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[9]  Philippe Baptiste,et al.  A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[10]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[11]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[12]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[13]  James A. Hendler,et al.  Readings in Planning , 1994 .

[14]  Daniel S. Weld,et al.  Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.

[15]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

[16]  Hans W. Guesgen,et al.  A Perspective of Constraint-Based Reasoning , 1992, Lecture Notes in Computer Science.

[17]  Didier Dubois,et al.  Fuzzy constraints in job-shop scheduling , 1995, J. Intell. Manuf..

[18]  Didier Dubois,et al.  Refinements of the maximin approach to decision-making in a fuzzy environment , 1996, Fuzzy Sets Syst..

[19]  Pedro Meseguer,et al.  Constraint Satisfaction Problems: An Overview , 1989, AI Commun..

[20]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[21]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[22]  Brian Falkenhainer,et al.  Compositional Modeling: Finding the Right Model for the Job , 1991, Artif. Intell..

[23]  Steve A. Chien.  Static and Completion Analysis for Planning Knowledge Base Development and Verification , 1996, AIPS.

[24]  Michael J. Maher,et al.  Constraint Hierarchies and Logic Programming , 1989, ICLP.

[25]  D. Long,et al.  E cient Implementation of the Plan Graph in STAN , 1999 .

[26]  Matthew L. Ginsberg,et al.  Supermodels and Robustness , 1998, AAAI/IAAI.

[27]  Q. Shen,et al.  Flexible Blackbox : Preliminary Results , 2000 .

[28]  Javier Larrosa,et al.  Solving fuzzy constraint satisfaction problems , 1997, Proceedings of 6th International Fuzzy Systems Conference.

[29]  Qiang Shen,et al.  Hard, flexible and dynamic constraint satisfaction , 1999, The Knowledge Engineering Review.

[30]  Sam Steel,et al.  Integrating Planning, Execution and Monitoring , 1988, AAAI.

[31]  Mike J. Chantler,et al.  Choosing the right model , 1999 .

[32]  Drew McDermott,et al.  A General Framework for Reason Maintenance , 1991, Artif. Intell..

[33]  Eugene C. Freuder,et al.  Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.

[34]  Pascal Van Hentenryck,et al.  An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.

[35]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[36]  Qiang Shen,et al.  Flexible Graphplan , 2000, ECAI.

[37]  Martin Charles Golumbic,et al.  Constraint Satisfiability Algorithms for Interactive Student Scheduling , 1989, IJCAI.

[38]  Philippe Baptiste,et al.  Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints , 1998, CP.

[39]  Alan K. Mackworth.  On Reading Sketch Maps , 1977, IJCAI.

[40]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[41]  Matthew L. Ginsberg,et al.  GSAT and dynamic backtracking , 1994, KR 1994.

[42]  Didier Dubois,et al.  Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty , 1996, Applied Intelligence.

[43]  A. E. Eiben,et al.  Constraint-satisfaction problems. , 2000 .

[44]  Peter van Beek,et al.  A Theoretical Evaluation of Selected Backtracking Algorithms , 1995, IJCAI.

[45]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[46]  Rina Dechter,et al.  In Search of the Best Constraint Satisfaction Search , 1994, AAAI.

[47]  Q. Shen,et al.  Extending FCSP to support dynamically changing problems , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

[48]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[49]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[50]  Maurice Bruynooghe.  Graph coloring and constraint satisfaction , 1985 .

[51]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[52]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[53]  Christian Bessiere,et al.  Using Inference to Reduce Arc Consistency Computation , 1995, IJCAI.

[54]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[55]  Bernhard Nebel,et al.  Extending Planning Graphs to an ADL Subset , 1997, ECP.

[56]  Stephen Beale,et al.  Using Branch-and-Bound with Constraint Satisfaction in Optimization Problems , 1997, AAAI/IAAI.

[57]  John Langford,et al.  Probabilistic Planning in the Graphplan Framework , 1999, ECP.

[58]  Robert M. Haralick,et al.  Efficient Graph Automorphism by Vertex Partitioning , 1983, Artif. Intell..

[59]  Qiang Shen,et al.  Dynamic Flexible Constraint Satisfaction , 2000, Applied Intelligence.

[60]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[61]  Shimon Even,et al.  Graph Algorithms , 1979 .

[62]  Rina Dechter,et al.  Look-Ahead Value Ordering for Constraint Satisfaction Problems , 1995, IJCAI.

[63]  James F. Allen.  Towards a General Theory of Action and Time , 1984, Artif. Intell..

[64]  Blai Bonet,et al.  The AIPS-98 Planning Competition , 2000, AI Mag..

[65]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems , 1989, IJCAI.

[66]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[67]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[68]  Subbarao Kambhampati,et al.  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..

[69]  Christophe Lecoutre.  Constraint Networks , 1992 .

[70]  Jérôme Lang,et al.  Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints , 1991, FAIR.

[71]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[72]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[73]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[74]  Robert P. Goldman,et al.  Conditional Linear Planning , 1994, AIPS.

[75]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[76]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[77]  Toby Walsh,et al.  The Constrainedness of Arc Consistency , 1997, CP.

[78]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[79]  Daniel G. Bobrow,et al.  Model-Based Computing: Developing Flexible Machine Control Software , 1999, Artif. Intell..

[80]  Lakhdar Sais,et al.  Tabu Search for SAT , 1997, AAAI/IAAI.

[81]  A. John Mallinckrodt,et al.  Qualitative reasoning: Modeling and simulation with incomplete knowledge , 1994, at - Automatisierungstechnik.

[82]  Didier Dubois,et al.  Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .

[83]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[84]  Jérôme Lang,et al.  Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.

[85]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[86]  Ho-fung Leung,et al.  A Constraint-Based Interactive Train Rescheduling Tool , 1996, CP.

[87]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[88]  Martin C. Cooper.  An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

[89]  R. C. Thomas,et al.  Computer Vision: A First Course , 1988 .

[90]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[91]  Martha E. Pollack,et al.  Passive and active decision postponement in plan generation , 1996 .

[92]  Michael C. Frank,et al.  Search Lessons Learned from Crossword Puzzles , 1990, AAAI.

[93]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[94]  Thomas H. Kolbe,et al.  Constraints for Object Recognition in Aerial Images - Handling of Unobserved Features , 1998, CP.

[95]  Jeroen Keppens,et al.  Centre for Intelligent Systems and Their Applications on Compositional Modelling on Compositional Modelling on Compositional Modelling* , 2022 .

[96]  Toby Walsh,et al.  The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.

[97]  Andrew B. Baker,et al.  The Hazards of Fancy Backtracking , 1994, AAAI.

[98]  Jean-Claude Latombe,et al.  Making Compromises Among Antagonist Constraints in a Planner , 1985, Artif. Intell..

[99]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[100]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..