Glossary Category:

First order reified term

A first-order reified term or FORT, represented in the Cyc Knowledge Base by #$CycLReifiedDenotationalTerm, is a represented term in CycL that is reified in the KB. There are two types of FORTs: constants and non-atomic reified terms.

First-order logic

First-order logic (FOL) (also called first-order predicate calculus (FOPC)) is a formal language incorporating predicate symbols, function symbols, constant symbols, variables, logical connectives and quantifiers, which can be used to express facts about a world....

Formula

In CycL, a formula, represented in the Cyc Knowledge Base by #$CycLFormula, is a type of term that consists of a CycL expression that denotes a relation (e.g. a predicate) — or at least an expression that could be interpreted as having a relation as its semantic...

Forward assertion

“Forward” is one of the possible values for direction that an assertion may have. If an assertion is :forward, it may participate in both forward and backward inference.

Forward inference

Forward inference refers to a mode of inference in which rules fire as soon as their antecedents become true. “Forward” is also one of the possible values for direction that an assertion may have. If an assertion is :forward, it may participate in both...