The computational complexity of avoiding spurious states in state space abstraction

&
Artificial Intelligence 174 (14):1072-1092 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2010.06.002

Links

PhilArchive



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

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

The Swapping Constraint.Henry Ian Schiller - 2018 - Minds and Machines 28 (3):605-622.
How Computational Models Predict the Behavior of Complex Systems.John Symons & Fabio Boschetti - 2013 - Foundations of Science 18 (4):809-821.
Model checking lattices: using and reasoning about information orders for abstraction.S. Hazelhurst & C. Seger - 1999 - Logic Journal of the IGPL 7 (3):375-411.
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas.Jarmo Kontinen - 2013 - Studia Logica 101 (2):267-291.
Abstraction and computational complexity.D. Leivant - 1990 - Journal of Symbolic Logic 55:379-80.
Is grammar Markovian?Mark Baltin - unknown
Characterization of realizable space complexities.Joel I. Seiferas & Albert R. Meyer - 1995 - Annals of Pure and Applied Logic 73 (2):171-190.
Abstraction and Idealization in the Formal Verification of Software Systems.Nicola Angius - 2013 - Minds and Machines 23 (2):211-226.
The geometry of state space.M. Adelman, J. V. Corbett & C. A. Hurst - 1993 - Foundations of Physics 23 (2):211-223.
Space State on Earth and Beyond: Philosophy, Models, Experience and Prospects.Sergey Krichevsky & Sergey Udartsev - 2019 - Filosofiâ I Kosmologiâ 23:30-52.
The instrumental complexity of states.George Svetlichny - 1982 - Foundations of Physics 12 (3):301-326.
Philosophy of mathematics for computational design: spatial Intuition versus logic.J. Burry - unknown
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
On the complexity of finding paths in a two‐dimensional domain I: Shortest paths.Arthur W. Chou & Ker-I. Ko - 2004 - Mathematical Logic Quarterly 50 (6):551-572.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,310,999)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
Toward a model of representation changes.Richard E. Korf - 1980 - Artificial Intelligence 14 (1):41-78.

View all 9 references / Add more references