- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence 170 (3):298-335 (2006)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Sketch-based pruning of a solution space within a formal geometric constraint solver.C. Essert-Villard, P. Schreck & J. -F. Dufourd - 2000 - Artificial Intelligence 124 (1):139-159.
On the branching factor of the alpha-beta pruning algorithm.Gérard M. Baudet - 1978 - Artificial Intelligence 10 (2):173-199.
Confidence-based reasoning in stochastic constraint programming.Roberto Rossi, Brahim Hnich, S. Armagan Tarim & Steven Prestwich - 2015 - Artificial Intelligence 228 (C):129-152.
An efficient algorithm for optimal pruning of decision trees.Hussein Almuallim - 1996 - Artificial Intelligence 83 (2):347-362.
A new probabilistic constraint logic programming language based on a generalised distribution semantics.Steffen Michels, Arjen Hommersom, Peter J. F. Lucas & Marina Velikova - 2015 - Artificial Intelligence 228 (C):1-44.
Constraint satisfaction using constraint logic programming.Pascal Van Hentenryck, Helmut Simonis & Mehmet Dincbas - 1992 - Artificial Intelligence 58 (1-3):113-159.
On the modelling and optimization of preferences in constraint-based temporal reasoning.Michael D. Moffitt - 2011 - Artificial Intelligence 175 (7-8):1390-1409.
Managing concurrency in temporal planning using planner-scheduler interaction.Andrew Coles, Maria Fox, Keith Halsey, Derek Long & Amanda Smith - 2009 - Artificial Intelligence 173 (1):1-44.
Open constraint programming.Boi Faltings & Santiago Macho-Gonzalez - 2005 - Artificial Intelligence 161 (1-2):181-208.
Constrained clustering by constraint programming.Thi-Bich-Hanh Dao, Khanh-Chuong Duong & Christel Vrain - 2017 - Artificial Intelligence 244 (C):70-94.
Analytics
Added to PP
2020-12-22
Downloads
52 (#1,141,892)
6 months
15 (#809,700)
2020-12-22
Downloads
52 (#1,141,892)
6 months
15 (#809,700)
Historical graph of downloads
Citations of this work
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners.Alfonso E. Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti & Yannis Dimopoulos - 2009 - Artificial Intelligence 173 (5-6):619-668.
On the complexity of planning for agent teams and its implications for single agent planning.Ronen I. Brafman & Carmel Domshlak - 2013 - Artificial Intelligence 198 (C):52-71.
Planning as satisfiability: Heuristics.Jussi Rintanen - 2012 - Artificial Intelligence 193 (C):45-86.
Reasoning from last conflict(s) in constraint programming.Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary & Vincent Vidal - 2009 - Artificial Intelligence 173 (18):1592-1614.
Long-distance mutual exclusion for planning.Yixin Chen, Ruoyun Huang, Zhao Xing & Weixiong Zhang - 2009 - Artificial Intelligence 173 (2):365-391.
References found in this work
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.Subbarao Kambhampati, Craig A. Knoblock & Qiang Yang - 1995 - Artificial Intelligence 76 (1-2):167-238.
Constraint satisfaction using constraint logic programming.Pascal Van Hentenryck, Helmut Simonis & Mehmet Dincbas - 1992 - Artificial Intelligence 58 (1-3):113-159.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation