State-set branching: Leveraging BDDs for heuristic search

, &
Artificial Intelligence 172 (2-3):103-139 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2007.05.009

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

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

Zero, successor and equality in BDDs.Bahareh Badban & Jaco van de Pol - 2005 - Annals of Pure and Applied Logic 133 (1-3):101-123.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
The Central Role of Heuristic Search in Cognitive Computation Systems.Wai-Tat Fu - 2016 - Minds and Machines 26 (1-2):103-123.
Between Logic and Heuristic.S. L. Katretchko - 1998 - The Paideia Archive: Twentieth World Congress of Philosophy 8:88-91.
(In)determinism, Branching Time, and Branching Space.Alexander Hughes - manuscript
Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
Against Branching Identity.William A. Bauer - 2017 - Philosophia 45 (4):1709-1719.
Branching in the landscape of possibilities.Thomas Müller - 2012 - Synthese 188 (1):41-65.
Chapter 10 Pruning Some Branches from “Branching Spacetimes”.John Earman - 2008 - In .
Does branching explain flow of time or the other way around?Petr Švarný - 2015 - Synthese 192 (7):2273-2292.
Emergent mathematics in a grade-two classroom: A search for complex relationships.Noel Geoghegan - unknown
Agatha: Using heuristic search to automate the construction of case law theories. [REVIEW]Alison Chorley & Trevor Bench-Capon - 2005 - Artificial Intelligence and Law 13 (1):9-51.
Using criticalities as a heuristic for answer set programming.Orkunt Sabuncu, Ferda N. Alpaslan & Varol Akman - 2003 - In Vladimir Lifschitz & Ilkka Niemela (eds.), Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence 2923 (7th International Conference, LPNMR 2004, Fort Lauderdale, FL, January 6-8, 2004 Proceedings). Berlin, Heidelberg: Springer. pp. 234-246.
Non-branching Clause.Huiyuhl Yi - 2010 - Metaphysica 11 (2):191-210.
If time travel to our location is possible, we do not live in a branching universe.James Norton - 2018 - Analysis 78 (2):260-266.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,392,075)

6 months
6 (#530,265)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Partial-order planning.Anthony Barrett & Daniel S. Weld - 1994 - Artificial Intelligence 67 (1):71-112.

Add more references