Uses of Class
nars.entity.TruthValue

Packages that use TruthValue

nars.entity	Data entities that are independently stored
nars.inference	The inference rules and control functions
nars.io	Input/output management
nars.main	Top-level classes of the system

Uses of TruthValue in nars.entity

Fields in nars.entity declared as TruthValue

protected TruthValue

Sentence.truth The truth value of Judgment or desire value of Goal

Methods in nars.entity that return TruthValue

TruthValue

Sentence.getTruth() Get the truth value of the sentence

Methods in nars.entity with parameters of type TruthValue

float	TruthValue.getExpDifAbs(TruthValue t) Calculate the absolute difference of the expectation value and that of a given truth value
static Sentence	Sentence.make(Sentence oldS, Term term, TruthValue truth, Stamp stamp, TemporalValue tense) Make a derived Sentence from a template and some initial values.
static Sentence	Sentence.make(Term term, char punc, TruthValue truth, Stamp stamp, TemporalValue tense) Make a Sentence from an input String.

Constructors in nars.entity with parameters of type TruthValue

Goal(Term term, char punc, TruthValue t, Stamp s)
Constructor

Judgment(Term term, char punc, TruthValue t, Stamp b)
Constructor

TruthValue(TruthValue v)
Constructor with a TruthValue to clone

Uses of TruthValue in nars.inference

Methods in nars.inference that return TruthValue

(package private) static TruthValue	TruthFunctions.abduction(TruthValue v1, TruthValue v2) { M>, M>} |- P>
(package private) static TruthValue	TruthFunctions.analogy(TruthValue v1, TruthValue v2) { M>, P>} |- P>
(package private) static TruthValue	TruthFunctions.comparison(TruthValue v1, TruthValue v2) { S>, P>} |- P>
(package private) static TruthValue	TruthFunctions.contraposition(TruthValue v1) { B>} |- <(--, B) ==> (--, A)>
(package private) static TruthValue	TruthFunctions.conversion(TruthValue v1) { B>} |- A>
(package private) static TruthValue	TruthFunctions.deduction(TruthValue v1, TruthValue v2) { M>, P>} |- P>
(package private) static TruthValue	TruthFunctions.desireDed(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.desireInd(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.desireStrong(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.desireWeak(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.difference(TruthValue v1, TruthValue v2) { S>, P>} |- (S-P)>
(package private) static TruthValue	TruthFunctions.exemplification(TruthValue v1, TruthValue v2) { S>, M>} |- P>
(package private) static TruthValue	TruthFunctions.existAnalogy(TruthValue v1, TruthValue v2) {(&&, <#x() ==> M>, <#x() ==> P>), S ==> M} |- P>
(package private) static TruthValue	TruthFunctions.implied(TruthValue v1) { B>, B} |- A
(package private) static TruthValue	TruthFunctions.implying(TruthValue v1) { B>, A} |- B
(package private) static TruthValue	TruthFunctions.induction(TruthValue v1, TruthValue v2) { S>, P>} |- P>
(package private) static TruthValue	TruthFunctions.intersection(TruthValue v1, TruthValue v2) { S>, P>} |- (S&P)>
(package private) static TruthValue	TruthFunctions.negation(TruthValue v1) {A} |- (--A)
(package private) static TruthValue	TruthFunctions.negImply(TruthValue v1) { (--, B)>, A} |- B
(package private) static TruthValue	TruthFunctions.reduceConjunction(TruthValue v1, TruthValue v2) {(--, (&&, A, B)), B} |- (--, A)
(package private) static TruthValue	TruthFunctions.reduceConjunctionNeg(TruthValue v1, TruthValue v2) {(--, (&&, A, (--, B))), (--, B)} |- (--, A)
(package private) static TruthValue	TruthFunctions.reduceDisjunction(TruthValue v1, TruthValue v2) {(||, A, B), (--, B)} |- A
(package private) static TruthValue	TruthFunctions.resemblance(TruthValue v1, TruthValue v2) { M>, P>} |- P>
(package private) static TruthValue	TruthFunctions.revision(TruthValue v1, TruthValue v2) { P>, P>} |- P>
(package private) static TruthValue	TruthFunctions.temporalRevision(TruthValue v1, TruthValue v2, long t1, long t2, long t) Revision weighted by time difference
(package private) static TruthValue	TruthFunctions.union(TruthValue v1, TruthValue v2) { S>, P>} |- (S|P)>

Methods in nars.inference with parameters of type TruthValue

(package private) static TruthValue	TruthFunctions.abduction(TruthValue v1, TruthValue v2) { M>, M>} |- P>
(package private) static TruthValue	TruthFunctions.analogy(TruthValue v1, TruthValue v2) { M>, P>} |- P>
static BudgetValue	BudgetFunctions.backward(TruthValue truth) Backward inference result and adjustment, stronger case
static BudgetValue	BudgetFunctions.backwardWeak(TruthValue truth) Backward inference result and adjustment, weaker case
(package private) static TruthValue	TruthFunctions.comparison(TruthValue v1, TruthValue v2) { S>, P>} |- P>
static BudgetValue	BudgetFunctions.compoundForward(TruthValue truth, Term content) Forward inference with CompoundTerm conclusion
(package private) static TruthValue	TruthFunctions.contraposition(TruthValue v1) { B>} |- <(--, B) ==> (--, A)>
(package private) static TruthValue	TruthFunctions.conversion(TruthValue v1) { B>} |- A>
(package private) static TruthValue	TruthFunctions.deduction(TruthValue v1, TruthValue v2) { M>, P>} |- P>
(package private) static TruthValue	TruthFunctions.desireDed(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.desireInd(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.desireStrong(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.desireWeak(TruthValue v1, TruthValue v2) A function specially designed for desire value [To be refined]
(package private) static TruthValue	TruthFunctions.difference(TruthValue v1, TruthValue v2) { S>, P>} |- (S-P)>
(package private) static TruthValue	TruthFunctions.exemplification(TruthValue v1, TruthValue v2) { S>, M>} |- P>
(package private) static TruthValue	TruthFunctions.existAnalogy(TruthValue v1, TruthValue v2) {(&&, <#x() ==> M>, <#x() ==> P>), S ==> M} |- P>
(package private) static BudgetValue	BudgetFunctions.forward(TruthValue truth) Forward inference result and adjustment
(package private) static TruthValue	TruthFunctions.implied(TruthValue v1) { B>, B} |- A
(package private) static TruthValue	TruthFunctions.implying(TruthValue v1) { B>, A} |- B
(package private) static TruthValue	TruthFunctions.induction(TruthValue v1, TruthValue v2) { S>, P>} |- P>
(package private) static TruthValue	TruthFunctions.intersection(TruthValue v1, TruthValue v2) { S>, P>} |- (S&P)>
(package private) static TruthValue	TruthFunctions.negation(TruthValue v1) {A} |- (--A)
(package private) static TruthValue	TruthFunctions.negImply(TruthValue v1) { (--, B)>, A} |- B
private static void	CompositionalRules.processComposed(Statement statement, Term subject, Term predicate, TruthValue truth) Finish composing compound term
(package private) static TruthValue	TruthFunctions.reduceConjunction(TruthValue v1, TruthValue v2) {(--, (&&, A, B)), B} |- (--, A)
(package private) static TruthValue	TruthFunctions.reduceConjunctionNeg(TruthValue v1, TruthValue v2) {(--, (&&, A, (--, B))), (--, B)} |- (--, A)
(package private) static TruthValue	TruthFunctions.reduceDisjunction(TruthValue v1, TruthValue v2) {(||, A, B), (--, B)} |- A
(package private) static TruthValue	TruthFunctions.resemblance(TruthValue v1, TruthValue v2) { M>, P>} |- P>
(package private) static BudgetValue	BudgetFunctions.revise(TruthValue tTruth, TruthValue bTruth, TruthValue truth, Task task, boolean feedbackToLinks) Evaluate the quality of a revision, then de-prioritize the premises
(package private) static TruthValue	TruthFunctions.revision(TruthValue v1, TruthValue v2) { P>, P>} |- P>
private static void	StructuralRules.structuralStatement(Term subject, Term predicate, TruthValue truth) Common final operations of the above two methods
static BudgetValue	BudgetFunctions.temporalIndCom(BudgetValue b1, BudgetValue b2, TruthValue t) Special treatment for temporal induction and comparison among recent event, no feedback
(package private) static TruthValue	TruthFunctions.temporalRevision(TruthValue v1, TruthValue v2, long t1, long t2, long t) Revision weighted by time difference
static float	BudgetFunctions.truthToQuality(TruthValue t) Determine the quality of a judgment by its truth value alone
(package private) static TruthValue	TruthFunctions.union(TruthValue v1, TruthValue v2) { S>, P>} |- (S|P)>
(package private) static BudgetValue	BudgetFunctions.update(Task task, TruthValue bTruth) Update a belief

Uses of TruthValue in nars.io

Methods in nars.io that return TruthValue

private static TruthValue

StringParser.parseTruth(java.lang.String s, char type) parse the input String into a TruthValue (or DesireValue)

Methods in nars.io with parameters of type TruthValue

private static BudgetValue

StringParser.parseBudget(java.lang.String s, char punctuation, TruthValue truth) parse the input String into a BudgetValue

Uses of TruthValue in nars.main

Methods in nars.main with parameters of type TruthValue

static void	Memory.convertedJudgment(TruthValue truth, BudgetValue budget) Convert jusgment into different relation
static void	Memory.doublePremiseTask(BudgetValue budget, Term content, TruthValue truth) Shared final operations by all double-premise rules, called from the rules except StructuralRules
static void	Memory.singlePremiseTask(BudgetValue budget, Term content, TruthValue truth) Shared final operations by all single-premise rules, called in StructuralRules