Article ID Journal Published Year Pages File Type
523592 Journal of Visual Languages & Computing 2011 10 Pages PDF
Abstract
► 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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Preview
Reasoning with coincidence grids-A sequent-based logic and an analysis of complexity
Authors
, ,