Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems

Artificial Intelligence 86 (1):43-73 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Graph structure and monadic second-order logic: a language-theoretic approach.B. Courcelle - 2012 - New York: Cambridge University Press. Edited by Joost Engelfriet.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Same graph, different universe.Assaf Rinot - 2017 - Archive for Mathematical Logic 56 (7-8):783-796.
Nested PLS.Toshiyasu Arai - 2011 - Archive for Mathematical Logic 50 (3-4):395-409.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
A logician's view of graph polynomials.J. A. Makowsky, E. V. Ravve & T. Kotek - 2019 - Annals of Pure and Applied Logic 170 (9):1030-1069.
Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,517,814)

6 months
3 (#760,965)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.

Add more references