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

Authors:
Dave Barker-Plummer;Nik Swoboda
Affiliations:
Stanford University, Stanford, CA, 94305-4101, USA;Universidad Politécnica de Madrid, Boadilla del Monte, Madrid, 28660, Spain
Venue:
Journal of Visual Languages and Computing
Year:
2011

Citing 4
Cited 0

Logic and Visual Information

Logic and Visual Information
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Modeling Heterogeneous Systems

DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
A computational architecture for heterogeneous reasoning

Journal of Experimental & Theoretical Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Information is often represented in tabular format in everyday documents such as balance sheets, sales figures, and so on. Tables represent an interesting point in the spectrum of representation systems between pictures and sentences, since some aspects of tables are sentential or conventional in nature, while others are graphical. In this paper we describe a sequent-based logic for a particular formalized tabular representation system, that of coincidence grids. After presenting this system we will then provide an analysis of the complexity of reasoning with this formalism showing that the problem of deciding whether a coincidence grid can be consistently completed is NP-Complete.