Glossary Category:

Modus tollens

Modus tollens is a rule of inference which can be derived from modus ponens under which, given a knowledge base which contains the formulas “Not B” and “A implies B”, one may conclude “Not A”.

Monotonic assertion

Monotonic is one of the possible values for strength. If a formula is asserted with a strength of :monotonic, the resulting assertion(s) will have a truth value of either monotonically true or monotonically false, depending on whether or not the asserted formula was...

Monotonically true

An assertion which is monotonically true is true in all cases. In other words, unlike an assertion which is default true, it does not currently have exceptions. Such assertions are displayed in the Cyc Browser with a white ball. By default, every assertion in Cyc can...

Natural language

Natural language (NL) is just human language, for example English. This is in contrast to programming languages like Java. When people talk about “NL” aspects of Cyc, they are referring to Cyc’s Natural Language Processing (NLP) which includes both...

Non-atomic reified term

A non-atomic reified term or NART (rhymes with “cart”), represented in the Cyc Knowledge Base by #$CycLNonAtomicReifiedTerm, is a non-atomic term which has been reified. NARTs are a type of FORT, the other type being constants.