Jump to content

Implication graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Thisisraja (talk | contribs) at 08:19, 10 February 2007 (Created page with 'Implication Graph (IG) is a directed graph ''G(V, E)'' comprising vertex set ''V'' and directed edge set ''E''. Each vertex in V represent the true or the false sta...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Implication Graph (IG) is a directed graph G(V, E) comprising vertex set V and directed edge set E. Each vertex in V represent the true or the false status of a boolean literal and each directed edge e(u, v) connecting vertex u and vertex v represents the implication "If the literal u is true then the literal v is also true". IGs were originally used identifying if a Boolean expression is satisfiable or not.