Positive Fork Graph Calculus

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 and complete. Moreover, the playful nature of this calculus renders it much more intuitive than its equational counterpart.

• Type: Conference
• Year: 2009
• Where: LFCS
• Authors: Renata P. de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Jorge Petrúcio Viana
• Keywords: Artificial Intelligence, Fork Algebras, Graph Calculus, LFCS 2009, Positive Identities