lojix/prolog/src/main/com/thesett/aima/logic/fol/prolog/builtins/FirstStepBuiltIn.java
public boolean proofStep(ResolutionState state)
    {
        Clause query = state.getCurrentClause();

        // The query goals are placed onto the goal stack backwards so that their insertion order is reversed for an
        // intuitive left-to-right evaluation order.
        for (int i = query.getBody().length - 1; i >= 0; i--)
        {
            BuiltInFunctor newGoal = state.getBuiltInTransform().apply(query.getBody()[i]);
            state.getGoalStack().offer(newGoal);
        }

        return true;
    }
public boolean proofStep(ResolutionState state)
    {
        Clause query = state.getCurrentClause();

        // The query goals are placed onto the goal stack backwards so that their insertion order is reversed for an
        // intuitive left-to-right evaluation order.
        for (int i = query.getBody().length - 1; i >= 0; i--)
        {
            BuiltInFunctor newGoal = state.getBuiltInTransform().apply(query.getBody()[i]);
            state.getGoalStack().offer(newGoal);
        }

        return true;
    }
public boolean proofStep ( ResolutionState state ) { Clause query = state . getCurrentClause ( ) ; // The query goals are placed onto the goal stack backwards so that their insertion order is reversed for an // intuitive left-to-right evaluation order. for ( int i = query . getBody ( ) . length - 1 ; i >= 0 ; i -- ) { BuiltInFunctor newGoal = state . getBuiltInTransform ( ) . apply ( query . getBody ( ) [ i ] ) ; state . getGoalStack ( ) . offer ( newGoal ) ; } return true ; }
{@inheritDoc}
{