Browsing Interface : Welcome guest : log in
Home |  Graph |  LogLearn |  ]  KB:  Language:    Formal Language: 


KB Term:  Term intersection
English Word: 

Sigma KEE - Predicate
Predicate(predicate)

appearance as argument number 1
-------------------------


(subclass Predicate Relation) Merge.kif 3378-3378 Predicate is a subclass of relation
(subclass Predicate InheritableRelation) Merge.kif 3379-3379 Predicate is a subclass of inheritable relation
(documentation Predicate EnglishLanguage "A Predicate is a sentence-forming Relation. Each tuple in the Relation is a finite, ordered sequence of objects. The fact that a particular tuple is an element of a Predicate is denoted by '(*predicate* arg_1 arg_2 .. arg_n)', where the arg_i are the objects so related. In the case of BinaryPredicates, the fact can be read as `arg_1 is *predicate* arg_2' or `a *predicate* of arg_1 is arg_2'.") Merge.kif 3381-3387 Predicate is a subclass of inheritable relation

appearance as argument number 2
-------------------------


(instance contraryAttribute Predicate) Merge.kif 448-448 contrary attribute is an instance of predicate
(instance exhaustiveAttribute Predicate) Merge.kif 479-479 exhaustive attribute is an instance of predicate
(instance exhaustiveDecomposition Predicate) Merge.kif 539-539 exhaustive decomposition is an instance of predicate
(instance disjointDecomposition Predicate) Merge.kif 557-557 disjoint decomposition is an instance of predicate
(instance partition Predicate) Merge.kif 573-573 partition is an instance of predicate
(partition Relation Predicate Function) Merge.kif 2197-2197 Relation is exhaustively partitioned into predicate and function
(subclass BinaryPredicate Predicate) Merge.kif 3517-3517 Binary predicate is a subclass of predicate
(subclass TernaryPredicate Predicate) Merge.kif 3528-3528 Ternary predicate is a subclass of predicate
(subclass QuaternaryPredicate Predicate) Merge.kif 3539-3539 Quaternary predicate is a subclass of predicate
(subclass QuintaryPredicate Predicate) Merge.kif 3550-3550 Quintary predicate is a subclass of predicate
(subclass LogicalOperator Predicate) Merge.kif 3589-3589 Logical operator is a subclass of predicate
(subclass ClosedWorldPredicate Predicate) Merge.kif 18684-18684 Closed world predicate is a subclass of predicate
(instance processList Predicate) QoSontology.kif 795-795 process list is an instance of predicate
(termFormat EnglishLanguage Predicate "predicate") english_format.kif 1037-1037 process list is an instance of predicate

appearance as argument number 3
-------------------------


(domain minValue 1 Predicate) Merge.kif 18601-18601 The number 1 argument of min value is an instance of predicate
(domain maxValue 1 Predicate) Merge.kif 18619-18619 The number 1 argument of max value is an instance of predicate
(domain defaultMinValue 1 Predicate) Merge.kif 18637-18637 The number 1 argument of default min value is an instance of predicate
(domain defaultMaxValue 1 Predicate) Merge.kif 18654-18654 The number 1 argument of default max value is an instance of predicate
(domain defaultValue 1 Predicate) Merge.kif 18671-18671 The number 1 argument of default value is an instance of predicate

antecedent
-------------------------


(=>
    (and
        (subrelation ?REL1 ?REL2)
        (instance ?REL1 Predicate)
        (instance ?REL2 Predicate)
        (?REL1 @ROW))
    (?REL2 @ROW))
Merge.kif 186-192 If X is a subrelation of Y, X is an instance of predicate, Y is an instance of predicate, and X @ROW, then Y @ROW
(=>
    (and
        (instance ?REL1 Predicate)
        (instance ?REL2 Predicate)
        (disjointRelation ?REL1 ?REL2)
        (?REL1 @ROW2))
    (not
        (?REL2 @ROW2)))
Merge.kif 440-446 If X is an instance of predicate, Y is an instance of predicate, X and Y are disjoint, and X @ROW2, then Y @ROW2
(=>
    (and
        (domain ?REL ?NUMBER ?CLASS)
        (instance ?REL Predicate)
        (?REL @ROW))
    (instance
        (ListOrderFn
            (ListFn @ROW) ?NUMBER) ?CLASS))
Merge.kif 3035-3040 If the number X argument of Y is an instance of Z, Y is an instance of predicate, and Y @ROW, then V element of (@ROW) is an instance of Z
(=>
    (and
        (domainSubclass ?REL ?NUMBER ?CLASS)
        (instance ?REL Predicate)
        (?REL @ROW))
    (subclass
        (ListOrderFn
            (ListFn @ROW) ?NUMBER) ?CLASS))
Merge.kif 3042-3047 If the number X argument of Y is a subclass of Z, Y is an instance of predicate, and Y @ROW, then V element of (@ROW) is a subclass of Z
(=>
    (and
        (valence ?REL ?NUMBER)
        (instance ?REL Predicate))
    (forall (@ROW)
        (=>
            (?REL @ROW)
            (equal
                (ListLengthFn
                    (ListFn @ROW)) ?NUMBER))))
Merge.kif 3085-3092 If X has Y argument(s) and X is an instance of predicate, then for all : if X @ROW, then equal length of (@ROW) and Y
(=>
    (and
        (instance ?RELATION ReflexiveRelation)
        (reflexiveOn ?RELATION ?CLASS)
        (instance ?RELATION Predicate))
    (forall (?INST)
        (=>
            (instance ?INST ?CLASS)
            (?RELATION ?INST ?INST))))
Merge.kif 3649-3657 If X is an instance of reflexive relation, X is reflexive on Y, and X is an instance of predicate, then For all Entity Z: if Z is an instance of Y, then X Z and Z
(=>
    (and
        (exactCardinality ?REL ?ARG 1)
        (instance ?REL Predicate))
    (exists (?X @ARGS)
        (and
            (?REL @ARGS)
            (equal ?X
                (ListOrderFn
                    (ListFn @ARGS) ?ARG))
            (not
                (exists (?Y)
                    (and
                        (equal ?Y
                            (ListOrderFn
                                (ListFn @ARGS) ?ARG))
                        (not
                            (equal ?X ?Y))))))))
Media.kif 2077-2092 If there can be 1 values to argument X of Y and Y is an instance of predicate, then there exist Z and @ARGS such that Y @ARGS and equal Z and V element of (@ARGS) and there doesn't exist U such that equal U and V element of (@ARGS) and equal Z and U
(=>
    (and
        (exactCardinality ?REL ?ARG 1)
        (instance ?REL Predicate)
        (?REL @ARGS)
        (equal ?X
            (ListOrderFn
                (ListFn @ARGS) ?ARG)))
    (not
        (exists (?Y)
            (and
                (equal ?Y
                    (ListOrderFn
                        (ListFn @ARGS) ?ARG))
                (not
                    (equal ?X ?Y))))))
Media.kif 2095-2105 If there can be 1 values to argument X of Y, Y is an instance of predicate, Y @ARGS, and equal W and V element of (@ARGS), then there doesn't exist U such that equal U and V element of (@ARGS) and equal W and U
(=>
    (and
        (exactCardinality ?REL ?ARG 1)
        (instance ?REL Predicate)
        (?REL @ARGS)
        (equal ?X
            (ListOrderFn
                (ListFn @ARGS) ?ARG))
        (equal ?Y
            (ListOrderFn
                (ListFn @ARGS) ?ARG)))
    (equal ?X ?Y))
Media.kif 2108-2115 If there can be 1 values to argument X of Y, Y is an instance of predicate, Y @ARGS, equal W and V element of (@ARGS), and equal U and V element of (@ARGS), then equal W and U
(=>
    (and
        (exactCardinality ?REL ?ARG ?COUNT)
        (instance ?REL Predicate))
    (exists (?S ?EL @ARGS)
        (and
            (instance ?S SetOrClass)
            (=>
                (and
                    (?REL @ARGS)
                    (equal ?EL
                        (ListOrderFn
                            (ListFn @ARGS) ?ARG)))
                (and
                    (instance ?EL ?S)
                    (equal
                        (CardinalityFn ?S) ?COUNT))))))
Media.kif 2139-2152 If there can be X values to argument Y of Z and Z is an instance of predicate, then there exist W, V and @ARGS such that W is an instance of set or class and Z @ARGS and equal V and T element of (@ARGS)V is an instance of W and equal the number of instances in W and X
(=>
    (and
        (minCardinality ?REL ?ARG ?COUNT)
        (instance ?REL Predicate))
    (exists (?S ?EL @ARGS)
        (and
            (instance ?S SetOrClass)
            (=>
                (and
                    (?REL @ARGS)
                    (equal ?EL
                        (ListOrderFn
                            (ListFn @ARGS) ?ARG)))
                (and
                    (instance ?EL ?S)
                    (greaterThanOrEqualTo
                        (CardinalityFn ?S) ?COUNT))))))
Media.kif 2176-2189 If there are at least X values to argument Y of Z and Z is an instance of predicate, then there exist W, V and @ARGS such that W is an instance of set or class and Z @ARGS and equal V and T element of (@ARGS)V is an instance of W and the number of instances in W is greater than or equal to X
(=>
    (and
        (maxCardinality ?REL ?ARG ?COUNT)
        (instance ?REL Predicate))
    (exists (?S ?EL @ARGS)
        (and
            (instance ?S SetOrClass)
            (=>
                (and
                    (?REL @ARGS)
                    (equal ?EL
                        (ListOrderFn
                            (ListFn @ARGS) ?ARG)))
                (and
                    (instance ?EL ?S)
                    (lessThanOrEqualTo
                        (CardinalityFn ?S) ?COUNT))))))
Media.kif 2212-2225 If there can be at most X values to argument Y of Z and Z is an instance of predicate, then there exist W, V and @ARGS such that W is an instance of set or class and Z @ARGS and equal V and T element of (@ARGS)V is an instance of W and the number of instances in W is less than or equal to X


Show full definition with tree view
Show simplified definition (without tree view)
Show simplified definition (with tree view)



Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is open source software produced by Articulate Software and its partners