use of nars.entity.BudgetValue in project opennars by opennars.
the class CompositionalRules method processComposed.
/**
* Finish composing implication term
*
* @param premise1 Type of the contentInd
* @param subject Subject of contentInd
* @param predicate Predicate of contentInd
* @param truth TruthValue of the contentInd
* @param memory Reference to the memory
*/
private static void processComposed(final Statement statement, final Term subject, final Term predicate, final int order, final TruthValue truth, final DerivationContext nal) {
if ((subject == null) || (predicate == null)) {
return;
}
Term content = Statement.make(statement, subject, predicate, order);
if ((content == null) || statement == null || content.equals(statement) || content.equals(nal.getCurrentBelief().term)) {
return;
}
BudgetValue budget = BudgetFunctions.compoundForward(truth, content, nal);
// (allow overlap) but not needed here, isn't detachment, this one would be even problematic from control perspective because its composition
nal.doublePremiseTask(content, truth, budget, false, false);
}
use of nars.entity.BudgetValue in project opennars by opennars.
the class CompositionalRules method introVarOuter.
/* --------------- rules used for variable introduction --------------- */
/**
* Introduce a dependent variable in an outer-layer conjunction {<S --> P1>,
* <S --> P2>} |- (&&, <#x --> P1>, <#x --> P2>)
*
* @param taskContent The first premise <M --> S>
* @param beliefContent The second premise <M --> P>
* @param index The location of the shared term: 0 for subject, 1 for
* predicate
* @param nal Reference to the memory
*/
public static void introVarOuter(final Statement taskContent, final Statement beliefContent, final int index, final DerivationContext nal) {
if (!(taskContent instanceof Inheritance)) {
return;
}
Variable varInd1 = new Variable("$varInd1");
Variable varInd2 = new Variable("$varInd2");
Term term11dependent = null, term12dependent = null, term21dependent = null, term22dependent = null;
Term term11, term12, term21, term22, commonTerm = null;
HashMap<Term, Term> subs = new HashMap<>();
if (index == 0) {
term11 = varInd1;
term21 = varInd1;
term12 = taskContent.getPredicate();
term22 = beliefContent.getPredicate();
term12dependent = term12;
term22dependent = term22;
if (term12 instanceof ImageExt) {
if ((/*(ImageExt)*/
term12).containsTermRecursively(term22)) {
commonTerm = term22;
}
if (commonTerm == null && term12 instanceof ImageExt) {
commonTerm = ((ImageExt) term12).getTheOtherComponent();
if (!(term22.containsTermRecursively(commonTerm))) {
commonTerm = null;
}
if (term22 instanceof ImageExt && ((commonTerm == null) || !(term22).containsTermRecursively(commonTerm))) {
commonTerm = ((ImageExt) term22).getTheOtherComponent();
if ((commonTerm == null) || !(term12).containsTermRecursively(commonTerm)) {
commonTerm = null;
}
}
}
if (commonTerm != null) {
subs.put(commonTerm, varInd2);
term12 = ((CompoundTerm) term12).applySubstitute(subs);
if (!(term22 instanceof CompoundTerm)) {
term22 = varInd2;
} else {
term22 = ((CompoundTerm) term22).applySubstitute(subs);
}
}
}
if (commonTerm == null && term22 instanceof ImageExt) {
if ((/*(ImageExt)*/
term22).containsTermRecursively(term12)) {
commonTerm = term12;
}
if (commonTerm == null && term22 instanceof ImageExt) {
commonTerm = ((ImageExt) term22).getTheOtherComponent();
if (!(term12.containsTermRecursively(commonTerm))) {
commonTerm = null;
}
if (term12 instanceof ImageExt && ((commonTerm == null) || !(term12).containsTermRecursively(commonTerm))) {
commonTerm = ((ImageExt) term12).getTheOtherComponent();
if ((commonTerm == null) || !(term22).containsTermRecursively(commonTerm)) {
commonTerm = null;
}
}
}
if (commonTerm != null) {
subs.put(commonTerm, varInd2);
term22 = ((CompoundTerm) term22).applySubstitute(subs);
if (!(term12 instanceof CompoundTerm)) {
term12 = varInd2;
} else {
term12 = ((CompoundTerm) term12).applySubstitute(subs);
}
}
}
} else {
term11 = taskContent.getSubject();
term21 = beliefContent.getSubject();
term12 = varInd1;
term22 = varInd1;
term11dependent = term11;
term21dependent = term21;
if (term21 instanceof ImageInt) {
if ((/*(ImageInt)*/
term21).containsTermRecursively(term11)) {
commonTerm = term11;
}
if (term11 instanceof ImageInt && commonTerm == null && term21 instanceof ImageInt) {
commonTerm = ((ImageInt) term11).getTheOtherComponent();
if (!(term21.containsTermRecursively(commonTerm))) {
commonTerm = null;
}
if ((commonTerm == null) || !(term21).containsTermRecursively(commonTerm)) {
commonTerm = ((ImageInt) term21).getTheOtherComponent();
if ((commonTerm == null) || !(term11).containsTermRecursively(commonTerm)) {
commonTerm = null;
}
}
}
if (commonTerm != null) {
subs.put(commonTerm, varInd2);
term21 = ((CompoundTerm) term21).applySubstitute(subs);
if (!(term11 instanceof CompoundTerm)) {
term11 = varInd2;
} else {
term11 = ((CompoundTerm) term11).applySubstitute(subs);
}
}
}
if (commonTerm == null && term11 instanceof ImageInt) {
if ((/*(ImageInt)*/
term11).containsTermRecursively(term21)) {
commonTerm = term21;
}
if (term21 instanceof ImageInt && commonTerm == null && term11 instanceof ImageInt) {
commonTerm = ((ImageInt) term21).getTheOtherComponent();
if (!(term11.containsTermRecursively(commonTerm))) {
commonTerm = null;
}
if ((commonTerm == null) || !(term11).containsTermRecursively(commonTerm)) {
commonTerm = ((ImageInt) term11).getTheOtherComponent();
if ((commonTerm == null) || !(term21).containsTermRecursively(commonTerm)) {
commonTerm = null;
}
}
}
if (commonTerm != null) {
subs.put(commonTerm, varInd2);
term11 = ((CompoundTerm) term11).applySubstitute(subs);
if (!(term21 instanceof CompoundTerm)) {
term21 = varInd2;
} else {
term21 = ((CompoundTerm) term21).applySubstitute(subs);
}
}
}
}
Statement state1 = Inheritance.make(term11, term12);
Statement state2 = Inheritance.make(term21, term22);
Term content = Implication.make(state1, state2);
if (content == null) {
return;
}
TruthValue truthT = nal.getCurrentTask().sentence.truth;
TruthValue truthB = nal.getCurrentBelief().truth;
if ((truthT == null) || (truthB == null)) {
if (Parameters.DEBUG) {
System.out.println("ERROR: Belief with null truth value. (introVarOuter)");
}
return;
}
TruthValue truth = induction(truthT, truthB);
BudgetValue budget = BudgetFunctions.compoundForward(truth, content, nal);
nal.doublePremiseTask(content, truth, budget, false, false);
content = Implication.make(state2, state1);
truth = induction(truthB, truthT);
budget = BudgetFunctions.compoundForward(truth, content, nal);
nal.doublePremiseTask(content, truth, budget, false, false);
content = Equivalence.make(state1, state2);
truth = comparison(truthT, truthB);
budget = BudgetFunctions.compoundForward(truth, content, nal);
nal.doublePremiseTask(content, truth, budget, false, false);
Variable varDep = new Variable("#varDep");
if (index == 0) {
state1 = Inheritance.make(varDep, term12dependent);
state2 = Inheritance.make(varDep, term22dependent);
} else {
state1 = Inheritance.make(term11dependent, varDep);
state2 = Inheritance.make(term21dependent, varDep);
}
if ((state1 == null) || (state2 == null))
return;
content = Conjunction.make(state1, state2);
truth = intersection(truthT, truthB);
budget = BudgetFunctions.compoundForward(truth, content, nal);
nal.doublePremiseTask(content, truth, budget, false, false);
}
use of nars.entity.BudgetValue in project opennars by opennars.
the class LocalRules method conversion.
/* -------------------- one-premise inference rules -------------------- */
/**
* {<P --> S>} |- <S --> P> Produce an Inheritance/Implication from a
* reversed Inheritance/Implication
*
* @param nal Reference to the memory
*/
private static void conversion(final DerivationContext nal) {
TruthValue truth = TruthFunctions.conversion(nal.getCurrentBelief().truth);
BudgetValue budget = BudgetFunctions.forward(truth, nal);
convertedJudgment(truth, budget, nal);
}
use of nars.entity.BudgetValue in project opennars by opennars.
the class LocalRules method inferToSym.
/* -------------------- two-premise inference rules -------------------- */
/**
* {<S --> P>, <P --> S} |- <S <-> p> Produce Similarity/Equivalence from a
* pair of reversed Inheritance/Implication
*
* @param judgment1 The first premise
* @param judgment2 The second premise
* @param nal Reference to the memory
*/
private static void inferToSym(Sentence judgment1, Sentence judgment2, DerivationContext nal) {
Statement s1 = (Statement) judgment1.term;
Term t1 = s1.getSubject();
Term t2 = s1.getPredicate();
Term content;
if (s1 instanceof Inheritance) {
content = Similarity.make(t1, t2);
} else {
content = Equivalence.make(t1, t2, s1.getTemporalOrder());
}
TruthValue value1 = judgment1.truth;
TruthValue value2 = judgment2.truth;
TruthValue truth = TruthFunctions.intersection(value1, value2);
BudgetValue budget = BudgetFunctions.forward(truth, nal);
// (allow overlap) but not needed here, isn't detachment
nal.doublePremiseTask(content, truth, budget, false, false);
}
use of nars.entity.BudgetValue in project opennars by opennars.
the class LocalRules method convertRelation.
/**
* {<S --> P>} |- <S <-> P> {<S <-> P>} |- <S --> P> Switch between
* Inheritance/Implication and Similarity/Equivalence
*
* @param nal Reference to the memory
*/
private static void convertRelation(final DerivationContext nal) {
TruthValue truth = nal.getCurrentBelief().truth;
if (((CompoundTerm) nal.getCurrentTask().getTerm()).isCommutative()) {
truth = TruthFunctions.abduction(truth, 1.0f);
} else {
truth = TruthFunctions.deduction(truth, 1.0f);
}
BudgetValue budget = BudgetFunctions.forward(truth, nal);
convertedJudgment(truth, budget, nal);
}
Aggregations