Finding models through graph saturation

Abstract We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these operations. We call these invariants sentences that we interpret over graphs. For questions stated through sets of these sentences, this paper gives a semi-decision procedure we call graph saturation. It decides entailment over these sentences, inspired on graph rewriting. We prove correctness of the procedure. Moreover, we show the corresponding decision problem to be undecidable. This confirms a conjecture previously stated by the author [7] .

[1]  Stef Joosten.  Software Development in Relation Algebra with Ampersand , 2017, RAMiCS.

[2]  Sebastiaan J. C. Joosten.  Parsing and Printing of and with Triples , 2017, RAMiCS.

[3]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[4]  Andre Scedrov,et al.  Categories, allegories , 1990, North-Holland mathematical library.

[5]  Daniel Jackson,et al.  Alloy: a lightweight object modelling notation , 2002, TSEM.

[6]  Daniel Jackson,et al.  Alcoa: the Alloy constraint analyzer , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[7]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[8]  Wolfram Kahl,et al.  A Relation-Algebraic Approach to Graph Structure Transformation , 2001, RelMiCS.

[9]  Carsten Lutz,et al.  Data Complexity in the EL family of DLs , 2007, Description Logics.

[10]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[11]  Franz Baader,et al.  Pushing the EL Envelope Further , 2008, OWLED.

[12]  Gunther Schmidt,et al.  Relation algebras: Concept of points and representability , 1985, Discret. Math..

[13]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.