01: package org.mandarax.reference;
02:
03: /*
04: * Copyright (C) 2002-2004 <a href="mailto:a.kozlenkov@city.ac.uk">Alex Kozlenkov</a>
05: *
06: * This library is free software; you can redistribute it and/or
07: * modify it under the terms of the GNU Lesser General Public
08: * License as published by the Free Software Foundation; either
09: * version 2 of the License, or (at your option) any later version.
10: *
11: * This library is distributed in the hope that it will be useful,
12: * but WITHOUT ANY WARRANTY; without even the implied warranty of
13: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14: * Lesser General Public License for more details.
15: *
16: * You should have received a copy of the GNU Lesser General Public
17: * License along with this library; if not, write to the Free Software
18: * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19: */
20:
21: import org.mandarax.kernel.*;
22:
23: /**
24: * Strict selection policy - just use the first negative literal of the goal.
25: * Prova re-integration modifications
26: * @author <A HREF="mailto:a.kozlenkov@city.ac.uk">Alex Kozlenkov</A>
27: * @version 3.4 <7 March 05>
28: */
29: public final class StrictSelectionPolicy implements SelectionPolicy {
30:
31: /**
32: * Return only the integer representing the left-most literal to attemp unification with the candidate.
33: * @return int[] the indices
34: * @param goal the goal
35: * @param appliedClause the clause that should be used to prove the goal
36: */
37: public int[] getOrderedPositions(Clause goal, Clause appliedClause) {
38: int[] positions = new int[1];
39: positions[0] = 0;
40: return positions;
41: }
42: }
|