Next: About this document
Up: Short Algernon Reference Manual
Previous: References
- *dont-print-slots*
- Interacting with the User
- :a
- Controlled Retrieval
- a-assert
- Calling Algernon from Lisp
- a-query
- Calling Algernon from Lisp
- access path
- Access Paths, Access Paths
- acom-com
- Interactive Interface Commands
- Algernon output
- Calling Algernon from Lisp
- :all-paths
- Control Structure
- :any
- Controlled Retrieval
- :ask
- Calling Algernon from Lisp , Interacting with the User
- :assume
- Negation and Non-Monotonic Reasoning
- :assumptions
- Calling Lisp from Algernon
- atomic formula
- Access Paths
- ground
- FactsFormulas, and Frames
- :backlink
- Declaring Slots and their
- backward chaining
- Calling Algernon from Lisp
- :bind
- Calling Lisp from Algernon
- BNF
- The Formal Syntax of
- :boundp
- Calling Lisp from Algernon
- :branch
- Calling Lisp from Algernon
- built in knowledge-base
- The Built-In Knowledge-Base\indexbuilt in
- :cardinality
- Declaring Slots and their
- :clear-slot
- Deleting Things
- :collect
- Calling Algernon from Lisp
- commands
- Interactive Interface Commands
- :comment
- Declaring Slots and their , Calling Algernon from Lisp
- coreference
- Helpful Hints
- :create
- Controlled Retrieval
- :cut
- Controlled Retrieval
- :db
- Controlled Retrieval, Controlling Style of Inference
- debugging
- Debugging\indexdebugging
- :declare-slot
- Declaring Slots and their
- :del-rule
- Deleting Things
- :del-rules
- Deleting Things
- :del-srule
- Deleting Things
- :del-srules
- Deleting Things
- :delete
- Deleting Things
- :eval
- Calling Algernon from Lisp , Calling Lisp from Algernon
- :fail
- Negation and Non-Monotonic Reasoning
- :forc
- Controlled Retrieval
- frame names
- Declaring a Taxonomy of
- funcall
- Calling Lisp from Algernon
- embedded
- Calling Lisp from Algernon
- generic rules
- Declaring Rules
- if-added incompleteness
- Rule Completion
- imp-superset
- Fundamental Objects and Relations
- :inverse
- Declaring Slots and their
- isa
- Fundamental Objects and Relations
- member
- Fundamental Objects and Relations
- names
- True Names and Public
- :neq
- Negation and Non-Monotonic Reasoning
- :no-completion
- Controlling Style of Inference
- :non-values
- Calling Lisp from Algernon
- :or
- Control Structure
- public name
- True Names and Public
- retrieval from
- True Names and Public
- retraction
- Rule Completion
- :retrieve
- Calling Algernon from Lisp , Controlled Retrieval, Controlling Style of Inference
- rule completion
- Rule Completion\indexrule completion
- rules
- Declaring Rules
- associated with sets
- Declaring Rules
- associated with slots
- Declaring Rules
- selfset
- Rule Completion
- :show
- Interacting with the User
- :slot
- Declaring Slots and their
- special forms
- (, )
- :srules
- Declaring Rules
- subset
- Fundamental Objects and Relations
- superset
- Fundamental Objects and Relations
- :taxonomy
- Declaring a Taxonomy of
- tell
- Calling Algernon from Lisp
- :test
- Calling Lisp from Algernon
- :the
- Controlled Retrieval
- tracing
- Tracing Algernon Inference
- transitive relations
- Declaring Rules
- true name
- True Names and Public
- :unboundp
- Calling Lisp from Algernon
- :unp
- Negation and Non-Monotonic Reasoning
- :values
- Calling Lisp from Algernon
- viewing frames and slots
- Browsing the Knowledge Base\indexviewing
- :w-contra-positive
- Controlling Style of Inference
- :wo-contra-positive
- Controlling Style of Inference
Micheal S. Hewett
Tue Oct 29 11:28:38 CST 1996