Visual Logic Programming through Set Inclusion and Chaining

Our research focuses on the design of easily accessible languages to formalize at very high level the preliminary specification of systems. A methodology to approach this problem is the use of visual languages with the idea of making logics more approachable by users. In this paper we present a first step towards this direction: the design of a visual logic programming language. This language is based on presenting logical predicates via diagrammatic set abstractions, and using graphical set inclusion as the main mechanism to construct formulas (= diagrams). We also show our intuitions for an operational semantics based on chaining within the context of resolution-based theorem proving, and explore some of the advantages of using our visual notation during the query solving process