| java.lang.Object
 org.mandarax.reference.DefaultSelectionPolicy
| DefaultSelectionPolicy | | final public class DefaultSelectionPolicy implements SelectionPolicy(Code) | | Selection policy that orders literals from the left to the right,
but moves all negated literals to the right.
Using this selection policy can proof R(a) from -P(x),Q(x) -> R(x),Q(a) , using
'left most selection' would only be able to do this with prerequisites
being in a different position.
author:
Jens Dietrich
version:
3.4 <7 March 05>
since:
2.0 |
| Method Summary | |
| public int[] | getOrderedPositions(Clause goal, Clause appliedClause)
Return an array of integers specifying in which order the inference engine
should attempt to unify the literals with the candidate. |
| getOrderedPositions | | public int[] getOrderedPositions(Clause goal, Clause appliedClause)(Code) | | Return an array of integers specifying in which order the inference engine
should attempt to unify the literals with the candidate.
int[] the indices
Parameters:
goal - the goal
Parameters:
appliedClause - the clause that should be used to prove the goal |
|
|