The way to show that one graph element does not follow from another is to make the cost of aligning them high.
the best-known such work has occurred within the field of question answering (Pasca and Harabagiu, 2001;Moldovan et al., 2003); more recently, such work has continued with greater focus in addressing the PASCAL Recognizing textual Entailment (RtE) Challenge (Dagan et al., 2005) and within the U.S. Government AQUAINt program.