Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP-Reference-Cited by-同舟云学术

Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

Author:

Do Minh Binh,Kambhampati Subbarao

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference39 articles.

1. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem;Bayardo,1996

3. Mixed integer programming models for planning problems;Bockmayr,1998

4. Planning as heuristic search: New results;Bonet,1999

5. A robust and fast action selection mechanism for planning;Bonet,1999

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Discrete Mother Tree Optimization and Swarm Intelligence for Constraint Satisfaction Problems;Proceedings of the 14th International Conference on Agents and Artificial Intelligence;2022

4. Chapter 19. Planning and SAT;Frontiers in Artificial Intelligence and Applications;2021-02-02

5. Automated Service Composition Using AI Planning and Beyond;Next-Gen Digital Services. A Retrospective and Roadmap for Service Computing of the Future;2021