Algorithms and conditional lower bounds for planning problems

, , &
Artificial Intelligence 297 (C):103499 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2021.103499

Links

PhilArchive



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

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

Conditional Random Quantities and Compounds of Conditionals.Angelo Gilio & Giuseppe Sanfilippo - 2014 - Studia Logica 102 (4):709-729.
Asymptotic conditional probabilities: The non-unary case.Adam J. Grove, Joseph Y. Halpern & Daphne Koller - 1996 - Journal of Symbolic Logic 61 (1):250-276.
A uniform method for proving lower bounds on the computational complexity of logical theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
Sharpened lower bounds for cut elimination.Samuel R. Buss - 2012 - Journal of Symbolic Logic 77 (2):656-668.
Conjunction, disjunction and iterated conditioning of conditional events.Angelo Gilio & Giuseppe Sanfilippo - 2013 - In R. Kruse (ed.), Advances in Intelligent Systems and Computing. Springer.
The Need for an Epistemology.John L. Pollock - unknown
The complexity of the disjunction and existential properties in intuitionistic logic.Sam Buss & Grigori Mints - 1999 - Annals of Pure and Applied Logic 99 (1-3):93-104.
Reward versus risk in uncertain inference: Theorems and simulations.Gerhard Schurz & Paul D. Thorn - 2012 - Review of Symbolic Logic 5 (4):574-612.
Lewis-Style Semantics for Conditional Logic of Obligation.Timothy Bowen Patrick - 1992 - Dissertation, University of Missouri - Columbia
More on lower bounds for partitioning α-large sets.Henryk Kotlarski, Bożena Piekart & Andreas Weiermann - 2007 - Annals of Pure and Applied Logic 147 (3):113-126.
About conditional probabilities of events regarding the quantum mechanical measurement process.Thomas Schürmann - unknown
On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines.Wolfgang Maass - 1988 - Journal of Symbolic Logic 53 (4):1098-1109.
Some lower bounds on Shelah rank in the free group.Javier de la Nuez González, Chloé Perin & Rizos Sklinos - 2020 - Annals of Pure and Applied Logic 171 (6):102794.
Upper and lower Ramsey bounds in bounded arithmetic.Kerry Ojakian - 2005 - Annals of Pure and Applied Logic 135 (1-3):135-150.
Lower bounds on volumes of hyperbolic Haken 3-manifolds.Agol Ian - unknown

Analytics

Added to PP
2021-03-17

Downloads
12 (#1,085,484)

6 months
3 (#976,558)

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

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.

Add more references