| java.lang.Object de.uka.ilkd.key.strategy.quantifierHeuristics.ClausesGraph
ClausesGraph | class ClausesGraph (Code) | | This class describes the relation between different clauses in a CNF.
If two clauses have the same existential quantifiable variable, we say
they are connected. And this property is transtitive.
|
connected | boolean connected(Term formula0, Term formula1)(Code) | | Parameters: formula0 - Parameters: formula1 - ture if clause of formula0 and clause of formula1 are connected. |
isFullGraph | boolean isFullGraph()(Code) | | |
|
|