Congruences of path algebras are useful in the definition and analysis of pathfinding problems, since properties of an algebra can be related to properties of its quotient. We show that this relationship can apply even when the algebraic objects involved satisfy weaker forms of the semiring or path algebra axioms. This is useful, since it is just these algebras and their quotients which we need to analyze pathfinding problems characterized by the need to obtain multiple paths even when path preferences are inconsistent, and paths can be filtered out arbitrarily, as in Internet routing. © 2011 Springer-Verlag.
CITATION STYLE
Gurney, A. J. T., & Griffin, T. G. (2011). Pathfinding through congruences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6663 LNCS, pp. 180–195). https://doi.org/10.1007/978-3-642-21070-9_15
Mendeley helps you to discover research relevant for your work.