Heuristics for planning with penalties and rewards formulated in logic and computed through circuits

Artificial Intelligence 172 (12-13):1579-1604 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

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

Through your library

Similar books and articles

Planning as satisfiability: Heuristics.Jussi Rintanen - 2012 - Artificial Intelligence 193 (C):45-86.
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
Planning routes through uncertain territory.Drew McDermott & Ernest Davis - 1984 - Artificial Intelligence 22 (2):107-156.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,013,551)

6 months
6 (#1,472,471)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

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.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.

View all 10 references / Add more references