astra.reasoner.node.BooleanTermFormulaNode Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of astra-interpreter Show documentation

Core interpreter artifact for the ASTRA Language

There is a newer version: 1.4.2

package astra.reasoner.node;

import java.util.Map;
import java.util.Stack;

import astra.formula.BooleanTermFormula;
import astra.reasoner.Reasoner;
import astra.reasoner.util.BindingsEvaluateVisitor;
import astra.term.Primitive;
import astra.term.Term;

public class BooleanTermFormulaNode extends ReasonerNode {
    ReasonerNode node;
    BooleanTermFormula formula;
    int state = 0;

    public BooleanTermFormulaNode(ReasonerNode parent, BooleanTermFormula formula, Map initial, boolean singleResult) {
        super(parent, singleResult);

        this.formula = formula;
        this.initial = initial;
    }

    @Override
    public ReasonerNode initialize(Reasoner reasoner) {
        visitor = new BindingsEvaluateVisitor(initial, reasoner.agent());
        formula = (BooleanTermFormula) formula.accept(visitor);
        // System.out.println("[Formula] " + formula);
        return super.initialize(reasoner);
    }

    @SuppressWarnings("unchecked")
    @Override
    public boolean solve(Reasoner reasoner, Stack stack) {
        // System.out.println("[BTFN] solve called: "  + formula);
        // System.out.println("[BTFN] value: " + ((Primitive) formula.term()).value());
        finished = true;

        failed = !((Primitive) formula.term()).value();
        solutions.add(initial);
        return !failed;
    }

    public String toString() {
        return formula +  " = " + solutions();
    }
    
}