Computing programs for generalized planning using a classical planner

, &
Artificial Intelligence 272 (C):52-85 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2018.10.006

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

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
Respecting Autonomy in Population Policy: An Argument for International Family Planning Programs.B. S. Hale & L. Hale - 2010 - Public Health Ethics 3 (2):157-166.
Reasoning defeasibly about plans.John Pollock - manuscript
Computing Generalized Specificity.Frieder Stolzenberg, Alejandro Javier Garcia, Carlos Ivan Chesñevar & Guillermo Ricardo Simari - 2003 - Journal of Applied Non-Classical Logics 13 (1):87-113.
Instrumentally Rational Myopic Planning.Chrisoula Andreou - 2004 - Philosophical Papers 33 (2):133-145.
Quantum Computing’s Classical Problem, Classical Computing’s Quantum Problem.Rodney Van Meter - 2014 - Foundations of Physics 44 (8):819-828.
Computational logic. Vol. 1: Classical deductive computing with classical logic. 2nd ed.Luis M. Augusto - 2022 - London: College Publications.
Research in Change History and Planning : What Can Historical Research Methods Teach the Planner, and How Can a Language of Change Be Developed? Questions Based on an Inventory of Historical Literature.Harald Berg - 1981 - Nordiska Institutet För Samhällsplanering.
The MADLA planner: Multi-agent planning by combination of distributed and local heuristic search.Michal Štolba & Antonín Komenda - 2017 - Artificial Intelligence 252 (C):175-210.
Computing and Programming in Context—Introduction.Tomas Petricek - 2020 - Philosophy and Technology 34 (1):7-11.
Computing as Empirical Science- Evolution as a Concept.Paweł Polak - 2016 - Studies in Logic, Grammar and Rhetoric 48 (1):49-69.
An Easy “Hard Problem” for Decision-Theoretic Planning.John L. Pollock - unknown
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.
Bi-facial Truth: a Case for Generalized Truth Values.Dmitry Zaitsev & Yaroslav Shramko - 2013 - Studia Logica 101 (6):1299-1318.
What a course on philosophy of computing is not.Vincent C. Müller - 2008 - APA Newsletter on Philosophy and Computers 8 (1):36-38.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,316,752)

6 months
6 (#518,648)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Generalization as search.Tom M. Mitchell - 1982 - Artificial Intelligence 18 (2):203-226.
In defense of PDDL axioms.Sylvie Thiébaux, Jörg Hoffmann & Bernhard Nebel - 2005 - Artificial Intelligence 168 (1-2):38-69.

View all 8 references / Add more references