Abstract
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. We show that this graph calculus is sound, complete and decidable. Moreover, the playful nature of this calculus renders it much more intuitive than its equational counterpart.
Research partially sponsored by CNPq (grants 301163/91-0, 471608/03-3 and 301526/2005-2), FAPERJ (grants E-26/131.180/2003, E-26/152.395/2002, APQ-1 E-26/ 170.335/2006, PRONEX E-26/171.536/2006 and Prociência) and FAPESP (grant ConsRel 2004/14107-2).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brown, C., Hutton, G.: Categories, allegories and circuit design. In: 9th IEEE Symp. Logic in Computer Science, pp. 372–381. IEEE Computer Society Press, Los Alamitos (1994)
Brown, C., Jeffrey, A.: Allegories of circuits. In: Proc. Logical Foundations of Computer Science, St. Petersburg, pp. 56–68 (1994)
Curtis, S., Lowe, G.: A graphical calculus. In: Möller, B. (ed.) MPC 1995. LNCS, vol. 947, pp. 214–231. Springer, Heidelberg (1995)
Curtis, S., Lowe, G.: Proofs with graphs. Sci. Comput. Program. 26, 197–216 (1996)
de Freitas, R.P., Veloso, P.A.S., Veloso, S.R.M., Viana, P.: Reasoning with graphs. ENTCS, vol. 165, pp. 201–212 (2006)
de Freitas, R.P., Veloso, P.A.S., Veloso, S.R.M., Viana, P.: On positive relational calculi. Logic J. IGPL 15, 577–601 (2006)
Freyd, P.J., Scedrov, A.: Categories, Allegories. North-Holland, Amsterdam (1990)
Frias, M.: Fork Algebras in Algebra, Logic and Computer Science. World Scientific, Singapore (2002)
Hirsch, R., Hodkinson, I.: Relation Algebras by Games. Elsevier, Amsterdam (2002)
Hutton, G.: A relational derivation of a functional program. In: Lecture Notes of the STOP Summer School on Constructive Algorithms, Ameland (1992)
Kahl, W.: Algebraic graph derivations for graphical calculi. In: D’Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol. 1197, pp. 224–238. Springer, Heidelberg (1997)
Kahl, W.: Relational treatment of term graphs with bound variables. Logic J. IGPL 6, 259–303 (1998)
Kahl, W.: Relational matching for graphical calculi of relations. Inform. Sciences 119, 253–273 (1999)
Maddux, R.D.: Relation Algebras. Elsevier, Amsterdam (2006)
Maddux, R.D.: Relation-algebraic semantics. Theor. Comput. Sci. 160, 1–85 (1996)
Mikulász, S., Sain, I., Simon, A.: Complexity of the equational theory of relation algebras with projection elements. Bull. Sect. Logic Univ. Lódź 21, 103–111 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Freitas, R., Veloso, S.R.M., Veloso, P.A.S., Viana, P. (2008). Positive Fork Graph Calculus. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-92687-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92686-3
Online ISBN: 978-3-540-92687-0
eBook Packages: Computer ScienceComputer Science (R0)