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. © Springer-Verlag Berlin Heidelberg 2009.
Author supplied keywords
Cite
CITATION STYLE
De Freitas, R., Veloso, S. R. M., Veloso, P. A. S., & Viana, P. (2009). Positive fork graph calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5407 LNCS, pp. 152–163). https://doi.org/10.1007/978-3-540-92687-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
