Reasoning with coincidence grids-A sequent-based logic and an analysis of complexity

► We provide a formalism for reasoning with coincidence grids. ► We present a sound and complete reasoning system for coincidence grids. ► Deciding if a coincidence grid has a solution is proved to be NP-Complete.