strictselectionpolicy.java

Mandarax是一个规则引擎的纯Java实现。它支持多类型的事实和基于反映的规则

package org.mandarax.reference;

/*
 * Copyright (C) 2002-2004 <a href="mailto:[e-mail]">Alex Kozlenkov</a>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

import org.mandarax.kernel.*;
/**
 * Strict selection policy - just use the first negative literal of the goal.
 * Prova re-integration modifications
 * @author <A HREF="mailto:[e-mail]">Alex Kozlenkov</A>
 * @version 3.4 <7 March 05>
 */
public final class StrictSelectionPolicy implements SelectionPolicy {

	/**
	 * Return only the integer representing the left-most literal to attemp unification with the candidate.
	 * @return int[] the indices
	 * @param goal the goal
	 * @param appliedClause the clause that should be used to prove the goal
	 */
	public int[] getOrderedPositions(Clause goal, Clause appliedClause) {
		int[] positions = new int[1];
		positions[0] = 0;
		return positions;
	}
}