Applicability conditions for plans with loops: Computability results and algorithms

, &
Artificial Intelligence 191-192 (C):1-19 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2012.07.005

Links

PhilArchive



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

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

Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Neil Immerman. Upper and lower bounds for first order expressibility. Journal of computer and system sciences, vol. 25 , pp. 76–98. - Neil Immerman. Relational queries computable in polynomial time. Information and control, vol. 68 , pp. 86–104. - Neil Immerman. Languages that capture complexity classes. SIAM journal on computing, vol. 16 , pp. 760–778. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
Algorithms and complexity results for persuasive argumentation.Eun Jung Kim, Sebastian Ordyniak & Stefan Szeider - 2011 - Artificial Intelligence 175 (9-10):1722-1736.
Complexity results and algorithms for possibilistic influence diagrams.Laurent Garcia & Régis Sabbadin - 2008 - Artificial Intelligence 172 (8-9):1018-1044.
Weighted argument systems: Basic definitions, algorithms, and complexity results.Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons & Michael Wooldridge - 2011 - Artificial Intelligence 175 (2):457-486.
[Omnibus Review].James S. Royer - 1999 - Journal of Symbolic Logic 64 (2):914-916.
On the range of applicability of an artificial intelligence machine.David Elliot Shaw - 1987 - Artificial Intelligence 32 (2):151-172.
Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results.Philippe Laborie - 2003 - Artificial Intelligence 143 (2):151-188.
omnibus Review. [REVIEW]James Royer - 1999 - Journal of Symbolic Logic 64 (2):914-916.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,281,906)

6 months
6 (#587,658)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

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.

Add more references