Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
Marco Baioletti, Stefano Marcugini, Alfredo Milani
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
—In spite of numerous search engines available on the web, no single engine is capable of performing “better” under all circumstances. This being the case, metasearch engines...
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...