Completeness proof strategies for Euler diagram logics

摘要: Visual logics based on Euler diagrams have recently been developed, including generalized constraint and concept dia- grams. Establishing the metatheories of these includes providing completeness proofs where possible. Completeness has established for such logics, diagrams, spider a fragment diagram logic. In this paper, we identify commonality in their proof strategies, showing how, as expressiveness in- creases, strategy readily extends. We demonstrate that does not extend to fragment. Thus, existing strategies are limited. Consequently, examine challenge devising new approaches proving more expressive logics.