Next: About this document
Up: Short Algernon User's Manual
Previous: References
- :a
- Controlled Retrieval
- a-assert
- Calling Algernon from Lisp
- a-query
- Calling Algernon from Lisp
- access paths
- Access Paths\indexaccess paths
- acom-com
- Interactive Interface Commands
- :all-paths
- Universal Quantification
- :any
- Controlled Retrieval
- :ask
- Calling Algernon from Lisp , Interacting with the User
- ask-slots
- Interacting with the User
- assertions
- Inference in Algernon
- :assume
- Negation and Non-Monotonic Reasoning
- :assumptions
- Calling Lisp from Algernon
- :backlink
- Declaring Slots and their
- backward chaining
- Rules Are Implications, Calling Algernon from Lisp
- :bind
- Calling Lisp from Algernon
- BNF
- The Formal Syntax of
- :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
- :create
- Controlled Retrieval
- :del-rule
- Deleting Things
- :del-rules
- Deleting Things
- :del-srule
- Deleting Things
- :del-srules
- Deleting Things
- :delete
- Deleting Things
- :eval
- Calling Lisp from Algernon
- :execute
- Calling Algernon from Lisp
- :fail
- Negation and Non-Monotonic Reasoning
- font usage
- Frames and Predicate Calculus
- :forc
- Controlled Retrieval
- forward chaining
- Rules Are Implications, Partitions
- frame names
- Frames and Their Names\indexframe , Declaring a Taxonomy of
- frames
- Frames
- funcall
- Calling Lisp from Algernon
- embedded
- Calling Lisp from Algernon
- generic rules
- Declaring Rules
- if-added
- Rules Are Implications
- if-added incompleteness
- Rule Completion
- if-needed
- Rules Are Implications
- imp-superset
- The Built-In Knowledge-Base
- :in-own-partition
- Controlling Style of Inference
- :inverse
- Declaring Slots and their
- isa
- The Built-In Knowledge-Base
- :lisp
- Calling Lisp from Algernon
- member
- The Built-In Knowledge-Base
- :neq
- Negation and Non-Monotonic Reasoning
- :no-completion
- Controlling Style of Inference
- :non-values
- Calling Lisp from Algernon
- :partition
- Declaring Slots and their
- partitions
- Partitions\indexpartitions
- predicate
- Access Paths
- ground
- Frames and Predicate Calculus
- predicate calculus
- Frames and Predicate Calculus
- queries
- Inference in Algernon
- quietly
- Calling Algernon from Lisp
- retraction
- Rule Completion
- :retrieve
- Controlled Retrieval, Calling Algernon from Lisp , Controlling Style of Inference
- rule completion
- Rule Completion\indexrule completion
- rules
- Declaring Rules
- associated with sets
- Inference in Algernon, Declaring Rules
- associated with sets
- Inference in Algernon, Declaring Rules
- associated with slots
- Inference in Algernon, Declaring Rules
- associated with slots
- Inference in Algernon, Declaring Rules
- selfset
- Rule Completion
- :show
- Interacting with the User
- silently
- Calling Algernon from Lisp
- :slot
- Declaring Slots and their
- slots
- numbers in
- Interacting with the User
- untyped
- Interacting with the User
- special forms
- (, )
- :srules
- Declaring Rules
- subset
- The Built-In Knowledge-Base
- superset
- The Built-In Knowledge-Base
- :taxonomy
- Declaring a Taxonomy of
- tell
- Calling Algernon from Lisp
- :test
- Calling Lisp from Algernon
- :the
- Controlled Retrieval
- tracing
- Tracing Commands
- transitive relations
- Declaring Rules
- :unp
- Negation and Non-Monotonic Reasoning
- :values
- Calling Lisp from Algernon
- variables
- Access Paths
- viewing frames and slots
- Browser Commands\indexviewing frames and
- :w-contra-positive
- Controlling Style of Inference
- :wo-contra-positive
- Controlling Style of Inference
Micheal S. Hewett
Tue Oct 29 11:15:33 CST 1996