Branching and pruning: An optimal temporal POCL planner based on constraint programming

&
Artificial Intelligence 170 (3):298-335 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2005.08.004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Some logical conundrums for decision-theoretic contingency planning.John Pollock - manuscript
Category-based Semantics for Equational and Constraint Logic Programming.Răzvan Diaconescu - 1994
Does branching explain flow of time or the other way around?Petr Švarný - 2015 - Synthese 192 (7):2273-2292.
Recent Advances in Constraints Joint Ercim/Colognet International Workshop on Constraint Solving and Constraint Logic Programming, Cork, Ireland, June 19-21, 2002 : Selected Papers.B. O'sullivan - 2003
Chapter 10 Pruning Some Branches from “Branching Spacetimes”.John Earman - 2008 - In .
Recent Advances in Constraints Joint Ercim/Colognet International Workshop on Constraint Solving and Constraint Logic Programming, Csclp 2003, Budapest, Hungary, June 30 - July 2, 2003 : Selected Papers.Krzysztof Apt, Francois Fages, Francesca Rossi, Peter Szeredi & Josef Váncza - 2004 - Springer Verlag.
(In)determinism, Branching Time, and Branching Space.Alexander Hughes - manuscript
A Copernican turn in temporal logics.Petr Švarný - unknown
Temporal Phylogenetic Networks and Logic Programming.Vladimir Lifschitz - unknown
Programming with Constraints: An Introduction.Kim Marriott & Peter J. Stuckey - 1998 - MIT Press.
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.
Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
Linear, branching time and joint closure semantics for temporal logic.Joeri Engelfriet & Jan Treur - 2002 - Journal of Logic, Language and Information 11 (4):389-425.
Psychological Continuity, Fission, and the Non-Branching Constraint.Robert Francescotti - 2008 - Pacific Philosophical Quarterly 89 (1):21-31.
Indeterminism is a modal notion: branching spacetimes and Earman’s pruning. [REVIEW]T. Placek - 2012 - Synthese 187 (2):441-469.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,341,274)

6 months
8 (#414,134)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Planning as satisfiability: Heuristics.Jussi Rintanen - 2012 - Artificial Intelligence 193 (C):45-86.
Landmark-enhanced abstraction heuristics.Carmel Domshlak, Michael Katz & Sagi Lefler - 2012 - Artificial Intelligence 189 (C):48-68.

View all 7 citations / Add more citations

References found in this work

Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.

View all 6 references / Add more references