01: // This file is part of KeY - Integrated Deductive Software Design
02: // Copyright (C) 2001-2007 Universitaet Karlsruhe, Germany
03: // Universitaet Koblenz-Landau, Germany
04: // Chalmers University of Technology, Sweden
05: //
06: // The KeY system is protected by the GNU General Public License.
07: // See LICENSE.TXT for details.
08: //
09: //
10:
11: package de.uka.ilkd.key.strategy.quantifierHeuristics;
12:
13: import de.uka.ilkd.key.logic.Term;
14: import de.uka.ilkd.key.strategy.termfeature.BinaryTermFeature;
15: import de.uka.ilkd.key.strategy.termfeature.TermFeature;
16:
17: /**
18: * Binary Term Feature return zero if root is a CNF quantifier formula with several
19: * clauses. And all the clause are CS-Related.
20: */
21: public class RecAndExistentiallyConnectedClausesFeature extends
22: BinaryTermFeature {
23: public static final TermFeature INSTANCE = new RecAndExistentiallyConnectedClausesFeature();
24:
25: private RecAndExistentiallyConnectedClausesFeature() {
26: }
27:
28: protected boolean filter(Term term) {
29: final ClausesGraph graph = ClausesGraph.create(term);
30: return graph.isFullGraph();
31: }
32: }
|