This talk explores the formalization of addition-subtraction chains as an extension to the well-researched addition chains. An addition chain for a positive integer n is a sequence
1 = a_0, a_1, ..., a_l = n
in which each a_k = a_i + a_j for some i, j < k, whereas an addition-subtraction chain allows a_k = a_i ± a_j. The talk explores a graph-theoretic method to compute the length of a shortest addition-subtraction chain reaching n, similar to the methods known for addition chains. We present an algorithm for efficiently computing such chains and some preliminary computation results. This research may prove practical in applications where this arithmetic represents computationally intensive tasks including elliptic curves. Other generalizations of additions chains are also explored.