The KIF vocabulary for representing metalinguistic knowledge.
Kif-Sets
Kif-Lists
Kif-Numbers
Configuration-Design
Vt-Design
Simple-Bikes
Vt-Domain
Vt-Example
Kif-Ontology
Conjunction
Disjunction
Equation
Equivalence
Expression
Word
Variable
Indvar
Seqvar
Operator
Termop
Sentop
Ruleop
Defop
Constant
Funconst
Relconst
Objconst
Sentence
Logconst
Logsent
Truth
Analytic-Truth
Implication
Inequality
Logterm
Negation
Quanterm
Quantsent
Relsent
Reverse-Implication
Term
Funterm
Listterm
Setterm
Quoterm
The following constants were used from included theories:
The following constants were used from theories not included:
All constants that were mentioned were defined.
KIF expression is either a word or a list of expressions.
(<=> (Expression ?Expr)
(Or (Word ?Expr)
(And (List ?Expr)
(Forall (?Subexpr)
(=> (Item ?Subexpr ?Expr)
(Expression ?Subexpr) )))))
An atom in a KIF expression.
(=> (Word ?Expr) (Not (List ?Expr)))
KIF variable
KIF operator
A constant used in a KIF expression.
A symbol that denotes a function. Used as the functor of a term expression.
A symbol that denotes a relation (may also be a function). Cannot be used as a functor of a term expression, even if it denotes a function.
A symbol that denotes a KIF object other than a relation.
An individual variable in a KIF expression. For every individual variable $nu$, there is an axiom asserting that it is indeed an individual variable. Each such axiom is a defining axiom for the {tt indvar} relation.
A sequence variable in a KIF expression. For every sequence variable $omega$, there is an axiom asserting that it is a sequence variable. Each such axiom is a defining axiom for the {tt seqvar} relation.
KIF term operator
(<=> (Termop ?Expr) (Operator ?Expr))
KIF sentence operator
(<=> (Sentop ?Expr) (Operator ?Expr))
KIF rule operator
(<=> (Ruleop ?Expr) (Operator ?Expr))
KIF definitional operator
(<=> (Defop ?Expr) (Operator ?Expr))
KIF term expression
KIF function term expression.
Slots Of Instances:
(<=> (Funterm ?Expr)
(And (Term ?Expr)
(List ?Expr)
(Value-Type ?Expr First Funconst) ))
KIF list term expression
(<=> (Listterm ?Expr)
(And (Term ?Expr) (List ?Expr) (= (First ?Expr) (Quote Listof))) )
KIF set term expression
(<=> (Setterm ?Expr)
(And (Term ?Expr) (List ?Expr) (= (First ?Expr) (Quote Setof))) )
KIF quoted term expression.
(<=> (Quoterm ?Expr)
(And (Term ?Expr)
(List ?Expr)
(= (First ?Expr) (Quote Quote))
(Expression (First (First ?Expr))) ))
(<=> (Logterm ?X)
(Or (Exists (?P1 ?T1)
(And (Sentence ?P1)
(Term ?T1)
(= ?X (Listof (Quote If) ?P1 ?T1)) ))
(Exists (?P1 ?T1 ?T2)
(And (Sentence ?P1)
(Term ?T1)
(Term ?T2)
(= ?X (Listof (Quote If) ?P1 ?T1 ?T2)) ))
(Exists (?Clist)
(And (List ?Clist)
(=> (Item ?C ?Clist)
(Exists (?P ?T)
(And (Sentence ?P)
(Term ?T)
(= ?C (Listof ?P ?T)) )))
(= ?X (Cons (Quote Cond) ?Clist)) ))))
(<=> (Quanterm ?X)
(Or (Exists (?T ?P)
(And (Term ?T)
(Sentence ?P)
(= ?X (Listof (Quote The) ?T ?P)) ))
(Exists (?T ?P)
(And (Term ?T)
(Sentence ?P)
(= ?X (Listof (Quote Setof) ?T ?P)) ))
(Exists (?Vlist ?P)
(And (List ?Vlist)
(Sentence ?P)
(>= (Length ?Vlist) 1)
(=> (Item ?V ?Vlistp) (Indvar ?V))
(= ?X (Listof (Quote Kappa) ?Vlistp ?P)) ))
(Exists (?Vlist ?Sv ?P)
(And (List ?Vlist)
(Seqvar ?Sv)
(Sentence ?P)
(=> (Item ?V ?Vlist) (Indvar ?V))
(= ?X
(Listof 'Kappa
(Append ?Vlist (Listof ?Sv))
?P))))
(Exists (?Vlist ?T)
(And (List ?Vlist)
(Term ?T)
(>= (Length ?Vlist) 1)
(=> (Item ?V ?Vlistp) (Indvar ?V))
(= ?X (Listof (Quote Lambda) ?Vlistp ?T)) ))
(Exists (?Vlist ?Sv ?T)
(And (List ?Vlist)
(Seqvar ?Sv)
(Sentence ?T)
(=> (Item ?V ?Vlist) (Indvar ?V))
(= ?X
(Listof 'Lambda
(Append ?Vlist (Listof ?Sv))
?T))))))
KIF sentence expression. Has a truth value.
A KIF logical constant.
(<=> (Relsent ?X)
(Exists (?R ?Tlist)
(And (Or (Relconst ?R) (Funconst ?R))
(List ?Tlist)
(>= (Length ?Tlist) 1)
(=> (Item ?T ?Tlist) (Term ?T))
(= ?X (Cons ?R ?Tlist)) )))
(<=> (Equation ?X)
(Exists (?T1 ?T2)
(And (Term ?T1)
(Term ?T2)
(= ?X (Listof (Quote =) ?T1 ?T2)) )))
(<=> (Inequality ?X)
(Exists (?T1 ?T2)
(And (Term ?T1)
(Term ?T2)
(= ?X (Listof (Quote /=) ?T1 ?T2)) )))
KIF logical sentence.
(<=> (Negation ?X)
(Exists (?P) (And (Sentence ?P) (= ?X (Listof (Quote Not) ?P)))) )
(<=> (Conjunction ?X)
(Exists (?Plist)
(And (List ?Plist)
(>= (Length ?Plist) 1)
(=> (Item ?P ?Plist) (Sentence ?P))
(= ?X (Cons (Quote And) ?Plist)) )))
(<=> (Disjunction ?X)
(Exists (?Plist)
(And (List ?Plist)
(>= (Length ?Plist) 1)
(=> (Item ?P ?Plist) (Sentence ?P))
(= ?X (Cons (Quote Or) ?Plist)) )))
(<=> (Implication ?X)
(Exists (?Plist)
(And (List ?Plist)
(>= (Length ?Plist) 2)
(=> (Item ?P ?Plist) (Sentence ?P))
(= ?X (Cons (Quote =>) ?Plist)) )))
(<=> (Reverse-Implication ?X)
(Exists (?Plist)
(And (List ?Plist)
(>= (Length ?Plist) 2)
(=> (Item ?P ?Plist) (Sentence ?P))
(= ?X (Cons (Quote <=) ?Plist)) )))
(<=> (Equivalence ?X)
(Exists (?P1 ?P2)
(And (Sentence ?P1)
(Sentence ?P2)
(= ?X (Listof (Quote <=>) ?P1 ?P2)) )))
(<=> (Quantsent ?X)
(Or (Exists (?V ?P)
(And (Indvar ?V)
(Sentence ?P)
(Or (= ?X (Listof (Quote Forall) ?V ?P))
(= ?X (Listof (Quote Exists) ?V ?P)) )))
(Exists (?Vlist ?P)
(And (List ?Vlist)
(Sentence ?P)
(>= (Length ?Vlist) 1)
(=> (Item ?V ?Vlist) (Indvar ?V))
(Or (= ?X (Listof (Quote Forall) ?Vlist ?P))
(= ?X (Listof (Quote Exists) ?Vlist ?P)) )))))
The term {tt (denotation $tau$)} denotes the object denoted by the object denoted by $tau$. A quotation denotes the quoted expression; the denotation of any other object is $bot$.
The term {tt (name $tau$)} denotes the standard name for the object denoted by the term $tau$. The standard name for an expression $tau$ is {tt (quote $tau$)}; the standard name for a non-expression is at the
discretion of the user. (Note that there are only a countable number of terms in KIF, but there can be models with uncountable cardinality; consequently, it is not always possible for every object in the universe of discourse to have a unique name.)
A level-crossing relation used to state that a sentence is true.
a defining axiom for a constant is a sentence that helps define the constant. See the KIF specification for details.
Given a knowledge base $Delta$, the sentence {tt (analytic-truth '$phi$)} means that the sentence $phi$ is logically entailed by the defining axioms of the definitions in knowledge base $Delta$.