Package org.opennars.inference

Class SyllogisticRules

java.lang.Object

org.opennars.inference.SyllogisticRules

public final class SyllogisticRules
extends Object

Syllogisms: Inference rules based on the transitivity of the relation.

Author:

Pei Wang, Patrick Hammer

Constructor Summary

Constructors

Constructor	Description
SyllogisticRules()

Method Summary

Modifier and Type	Method	Description
(package private) static boolean	abdIndCom(Term term1, Term term2, Sentence sentence1, Sentence sentence2, int figure, DerivationContext nal)	{<M ==> S>, <M ==> P>} |- {<S ==> P>, <P ==> S>, <S <=> P>}
(package private) static void	analogy(Term subj, Term pred, Sentence asym, Sentence sym, int figure, DerivationContext nal)	{<S ==> P>, <M <=> P>} |- <S ==> P>
(package private) static boolean	conditionalAbd(Term cond1, Term cond2, Statement st1, Statement st2, DerivationContext nal)	{<(&&, S2, S3) ==> P>, <(&&, S1, S3) ==> P>} |- <S1 ==> S2>
(package private) static void	conditionalAna(Equivalence premise1, short index, Term premise2, int side, DerivationContext nal)	{<(&&, S1, S2, S3) <=> P>, S1} |- <(&&, S2, S3) <=> P> {<(&&, S2, S3) <=> P>, <S1 ==> S2>} |- <(&&, S1, S3) <=> P> {<(&&, S1, S3) <=> P>, <S1 ==>
(package private) static void	conditionalDedInd(Sentence premise1Sentence, Implication premise1, short index, Term premise2, int side, DerivationContext nal)	{<(&&, S1, S2, S3) ==> P>, S1} |- <(&&, S2, S3) ==> P> {<(&&, S2, S3) ==> P>, <S1 ==> S2>} |- <(&&, S1, S3) ==> P> {<(&&, S1, S3) ==> P>, <S1 ==> S2>} |- <(&&, S2, S3) ==> P>
(package private) static void	dedExe(Term term1, Term term2, Sentence sentence, Sentence belief, DerivationContext nal)	{<S ==> M>, <M ==> P>} |- {<S ==> P>, <P ==> S>}
(package private) static void	detachment(Sentence mainSentence, Sentence subSentence, int side, boolean checkTermAgain, DerivationContext nal)
(package private) static void	detachment(Sentence mainSentence, Sentence subSentence, int side, DerivationContext nal)	{<<M --> S> ==> <M --> P>>, <M --> S>} |- <M --> P> {<<M --> S> ==> <M --> P>>, <M --> P>} |- <M --> S> {<<M --> S> <=> <M --> P>>, <M --> S>} |- <M --> P> {<<M --> S> <=> <M --> P>>, <M --> P>} |- <M --> S>
(package private) static void	elimiVarDep(CompoundTerm compound, Term component, boolean compoundTask, DerivationContext nal)	{(&&, <#x() --> S>, <#x() --> P>>, <M --> P>} |- <M --> S>
(package private) static void	resemblance(Term term1, Term term2, Sentence belief, Sentence sentence, int figure, DerivationContext nal)	{<S <=> M>, << <=> P>} |- <S <=> P>

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SyllogisticRules

public SyllogisticRules()

Method Detail

dedExe

static void dedExe(Term term1,
                   Term term2,
                   Sentence sentence,
                   Sentence belief,
                   DerivationContext nal)

 {<S ==> M>, <M ==> P>} |- {<S ==> P>, <P ==> S>}
 

Parameters:

term1 - Subject of the first new task

term2 - Predicate of the first new task

sentence - The first premise

belief - The second premise

nal - Reference to the memory

abdIndCom

static boolean abdIndCom(Term term1,
                         Term term2,
                         Sentence sentence1,
                         Sentence sentence2,
                         int figure,
                         DerivationContext nal)

{<M ==> S>, <M ==> P>} |- {<S ==> P>, <P ==> S>, <S <=> P>}

Parameters:

term1 - Subject of the first new task

term2 - Predicate of the first new task

sentence1 - The first premise

sentence2 - The second premise

figure - Locations of the shared term in premises --- can be removed?

nal - Reference to the memory

analogy

static void analogy(Term subj,
                    Term pred,
                    Sentence asym,
                    Sentence sym,
                    int figure,
                    DerivationContext nal)

{<S ==> P>, <M <=> P>} |- <S ==> P>

Parameters:

subj - Subject of the new task

pred - Predicate of the new task

asym - The asymmetric premise

sym - The symmetric premise

figure - Locations of the shared term in premises

nal - Reference to the memory

resemblance

static void resemblance(Term term1,
                        Term term2,
                        Sentence belief,
                        Sentence sentence,
                        int figure,
                        DerivationContext nal)

{<S <=> M>, << <=> P>} |- <S <=> P>

Parameters:

term1 - Subject of the new task

term2 - Predicate of the new task

belief - The first premise

sentence - The second premise

figure - Locations of the shared term in premises

nal - Reference to the memory

detachment

static void detachment(Sentence mainSentence,
                       Sentence subSentence,
                       int side,
                       DerivationContext nal)

{<<M --> S> ==> <M --> P>>, <M --> S>} |- <M --> P>
{<<M --> S> ==> <M --> P>>, <M --> P>} |- <M --> S>
{<<M --> S> <=> <M --> P>>, <M --> S>} |- <M --> P>
{<<M --> S> <=> <M --> P>>, <M --> P>} |- <M --> S>

Parameters:

mainSentence - The implication/equivalence premise

subSentence - The premise on part of s1

side - The location of s2 in s1

nal - Reference to the memory

detachment

static void detachment(Sentence mainSentence,
                       Sentence subSentence,
                       int side,
                       boolean checkTermAgain,
                       DerivationContext nal)

conditionalDedInd

static void conditionalDedInd(Sentence premise1Sentence,
                              Implication premise1,
                              short index,
                              Term premise2,
                              int side,
                              DerivationContext nal)

{<(&&, S1, S2, S3) ==> P>, S1} |- <(&&, S2, S3) ==> P>
{<(&&, S2, S3) ==> P>, <S1 ==> S2>} |- <(&&, S1, S3) ==> P>
{<(&&, S1, S3) ==> P>, <S1 ==> S2>} |- <(&&, S2, S3) ==> P>

Parameters:

premise1 - The conditional premise

index - The location of the shared term in the condition of premise1

premise2 - The premise which, or part of which, appears in the condition of premise1

side - The location of the shared term in premise2: 0 for subject, 1 for predicate, -1 for the whole term

nal - Reference to the memory

conditionalAna

static void conditionalAna(Equivalence premise1,
                           short index,
                           Term premise2,
                           int side,
                           DerivationContext nal)

{<(&&, S1, S2, S3) <=> P>, S1} |- <(&&, S2, S3) <=> P>
{<(&&, S2, S3) <=> P>, <S1 ==> S2>} |- <(&&, S1, S3) <=> P>
{<(&&, S1, S3) <=> P>, <S1 ==>

Parameters:

premise1 - The equivalence premise

index - The location of the shared term in the condition of premise1

premise2 - The premise which, or part of which, appears in the condition of premise1

side - The location of the shared term in premise2: 0 for subject, 1 for predicate, -1 for the whole term

nal - Reference to the memory

conditionalAbd

static boolean conditionalAbd(Term cond1,
                              Term cond2,
                              Statement st1,
                              Statement st2,
                              DerivationContext nal)

{<(&&, S2, S3) ==> P>, <(&&, S1, S3) ==> P>} |- <S1 ==> S2>

Parameters:

cond1 - The condition of the first premise

cond2 - The condition of the second premise

st1 - The first premise

st2 - The second premise

nal - Reference to the memory

Returns:

Whether there are derived tasks

elimiVarDep

static void elimiVarDep(CompoundTerm compound,
                        Term component,
                        boolean compoundTask,
                        DerivationContext nal)

{(&&, <#x() --> S>, <#x() --> P>>, <M --> P>} |- <M --> S>

Parameters:

compound - The compound term to be decomposed

component - The part of the compound to be removed

compoundTask - Whether the compound comes from the task

nal - Reference to the memory