Abstract. We present a sound and complete logical system for deriv-ing inclusions between graphs from inclusions between graphs, taken as hypotheses. Graphs provide a natural tool for expressing relations and reasoning about them. Here we extend this system to a sound and com-plete one to cope with proofs from hypotheses. This leads to a system dealing with complementation. Other approaches using pictures for re-lations use as bases the theory of allegories or rewriting systems. Our formalism is more widely applicable and provides a common denomina-tor of these approaches. Key words: Relational language, reasoning from hypotheses, graph cal-culus, completeness, complementation
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a re...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractIn this paper we study the (positive) graph relational calculus. The basis for this calculus...
AbstractIn this paper, we study the (positive) graph relational calculus. The basis for this calculu...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractCurtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197...
AbstractCurtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractIn this paper we study the (positive) graph relational calculus. The basis for this calculus...
This note presents a new formalization of graph rewritings which generalizes traditional graph rewri...
to appear in Theoretical Computer Science ARelational Graph Rewritings: This note presents a new for...
AbstractIn this paper, we study the (positive) graph relational calculus. The basis for this calculu...
AbstractThis note presents a new formalization of graph rewritings which generalizes traditional gra...
This note presents a new formalization of graph rewritings which generalizes tradi-tional graph rewr...
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a re...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractIn this paper we study the (positive) graph relational calculus. The basis for this calculus...
AbstractIn this paper, we study the (positive) graph relational calculus. The basis for this calculu...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractCurtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197...
AbstractCurtis and Lowe (S. Curtis, G. Lowe, Proofs with graphs, Sci. Comput. Program. 26 (1996) 197...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractIn this paper we study the (positive) graph relational calculus. The basis for this calculus...
This note presents a new formalization of graph rewritings which generalizes traditional graph rewri...
to appear in Theoretical Computer Science ARelational Graph Rewritings: This note presents a new for...
AbstractIn this paper, we study the (positive) graph relational calculus. The basis for this calculu...
AbstractThis note presents a new formalization of graph rewritings which generalizes traditional gra...
This note presents a new formalization of graph rewritings which generalizes tradi-tional graph rewr...
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a re...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...