Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the lisa Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Wed Jun 15 04:57:46 2022 GMT+0.
Next: Systems, Previous: The lisa Reference Manual, Up: The lisa Reference Manual [Contents][Index]
This is a fork of http://sourceforge.net/projects/lisa TODO: 1) Fix CL-implementation specific issues for OpenMCL and SBCL. DONE! 2009-06-24 2) Replace the hash-table based implementation of the activation list with an adjustable array. 3) Implement support for not as a connected constraint 4) Implement possibility to bind the same variable in two or more slots and make it so that this creates a join node on that variable in the Rete network. 5) ...
Next: Modules, Previous: Introduction, Up: The lisa Reference Manual [Contents][Index]
The main system appears first, followed by any subsystem dependency.
Next: Files, Previous: Systems, Up: The lisa Reference Manual [Contents][Index]
Modules are listed depth-first from the system components tree.
Next: lisa/src/packages, Previous: Modules, Up: Modules [Contents][Index]
lisa (system).
Next: lisa/src/utils, Previous: lisa/src, Up: Modules [Contents][Index]
src (module).
pkgdecl.lisp (file).
Next: lisa/src/belief-systems, Previous: lisa/src/packages, Up: Modules [Contents][Index]
packages (module).
src (module).
Next: lisa/src/reflect, Previous: lisa/src/utils, Up: Modules [Contents][Index]
utils (module).
src (module).
Next: lisa/src/core, Previous: lisa/src/belief-systems, Up: Modules [Contents][Index]
belief-systems (module).
src (module).
reflect.lisp (file).
Next: lisa/src/implementations, Previous: lisa/src/reflect, Up: Modules [Contents][Index]
reflect (module).
src (module).
Next: lisa/src/rete, Previous: lisa/src/core, Up: Modules [Contents][Index]
core (module).
src (module).
workarounds.lisp (file).
Next: lisa/src/config, Previous: lisa/src/implementations, Up: Modules [Contents][Index]
implementations (module).
src (module).
Previous: lisa/src/rete, Up: Modules [Contents][Index]
rete (module).
src (module).
Next: Packages, Previous: Modules, Up: The lisa Reference Manual [Contents][Index]
Files are sorted by type and then listed depth-first from the systems components trees.
Next: lisa/src/packages/pkgdecl.lisp, Previous: Lisp, Up: Lisp [Contents][Index]
lisa (system).
lisa.
Next: lisa/src/utils/compose.lisp, Previous: lisa/lisa.asd, Up: Lisp [Contents][Index]
packages (module).
Next: lisa/src/utils/utils.lisp, Previous: lisa/src/packages/pkgdecl.lisp, Up: Lisp [Contents][Index]
utils (module).
Next: lisa/src/belief-systems/belief.lisp, Previous: lisa/src/utils/compose.lisp, Up: Lisp [Contents][Index]
compose.lisp (file).
utils (module).
Next: lisa/src/belief-systems/certainty-factors.lisp, Previous: lisa/src/utils/utils.lisp, Up: Lisp [Contents][Index]
belief-systems (module).
Next: lisa/src/reflect/reflect.lisp, Previous: lisa/src/belief-systems/belief.lisp, Up: Lisp [Contents][Index]
belief.lisp (file).
belief-systems (module).
Next: lisa/src/core/preamble.lisp, Previous: lisa/src/belief-systems/certainty-factors.lisp, Up: Lisp [Contents][Index]
reflect (module).
Next: lisa/src/core/conditions.lisp, Previous: lisa/src/reflect/reflect.lisp, Up: Lisp [Contents][Index]
core (module).
Next: lisa/src/core/deffacts.lisp, Previous: lisa/src/core/preamble.lisp, Up: Lisp [Contents][Index]
preamble.lisp (file).
core (module).
Next: lisa/src/core/fact.lisp, Previous: lisa/src/core/conditions.lisp, Up: Lisp [Contents][Index]
conditions.lisp (file).
core (module).
Next: lisa/src/core/watches.lisp, Previous: lisa/src/core/deffacts.lisp, Up: Lisp [Contents][Index]
deffacts.lisp (file).
core (module).
Next: lisa/src/core/activation.lisp, Previous: lisa/src/core/fact.lisp, Up: Lisp [Contents][Index]
fact.lisp (file).
core (module).
Next: lisa/src/core/heap.lisp, Previous: lisa/src/core/watches.lisp, Up: Lisp [Contents][Index]
watches.lisp (file).
core (module).
Next: lisa/src/core/conflict-resolution-strategies.lisp, Previous: lisa/src/core/activation.lisp, Up: Lisp [Contents][Index]
activation.lisp (file).
core (module).
Next: lisa/src/core/context.lisp, Previous: lisa/src/core/heap.lisp, Up: Lisp [Contents][Index]
heap.lisp (file).
core (module).
Next: lisa/src/core/rule.lisp, Previous: lisa/src/core/conflict-resolution-strategies.lisp, Up: Lisp [Contents][Index]
core (module).
Next: lisa/src/core/pattern.lisp, Previous: lisa/src/core/context.lisp, Up: Lisp [Contents][Index]
context.lisp (file).
core (module).
Next: lisa/src/core/rule-parser.lisp, Previous: lisa/src/core/rule.lisp, Up: Lisp [Contents][Index]
rule.lisp (file).
core (module).
Next: lisa/src/core/fact-parser.lisp, Previous: lisa/src/core/pattern.lisp, Up: Lisp [Contents][Index]
pattern.lisp (file).
core (module).
Next: lisa/src/core/language.lisp, Previous: lisa/src/core/rule-parser.lisp, Up: Lisp [Contents][Index]
rule-parser.lisp (file).
core (module).
Next: lisa/src/core/tms-support.lisp, Previous: lisa/src/core/fact-parser.lisp, Up: Lisp [Contents][Index]
fact-parser.lisp (file).
core (module).
expand-slots (function).
Next: lisa/src/core/rete.lisp, Previous: lisa/src/core/language.lisp, Up: Lisp [Contents][Index]
language.lisp (file).
core (module).
Next: lisa/src/core/belief-interface.lisp, Previous: lisa/src/core/tms-support.lisp, Up: Lisp [Contents][Index]
tms-support.lisp (file).
core (module).
Next: lisa/src/core/meta.lisp, Previous: lisa/src/core/rete.lisp, Up: Lisp [Contents][Index]
rete.lisp (file).
core (module).
Next: lisa/src/core/binding.lisp, Previous: lisa/src/core/belief-interface.lisp, Up: Lisp [Contents][Index]
belief-interface.lisp (file).
core (module).
Next: lisa/src/core/token.lisp, Previous: lisa/src/core/meta.lisp, Up: Lisp [Contents][Index]
meta.lisp (file).
core (module).
Next: lisa/src/core/retrieve.lisp, Previous: lisa/src/core/binding.lisp, Up: Lisp [Contents][Index]
binding.lisp (file).
core (module).
token (class).
Next: lisa/src/implementations/workarounds.lisp, Previous: lisa/src/core/token.lisp, Up: Lisp [Contents][Index]
token.lisp (file).
core (module).
Next: lisa/src/rete/node-tests.lisp, Previous: lisa/src/core/retrieve.lisp, Up: Lisp [Contents][Index]
implementations (module).
Next: lisa/src/rete/shared-node.lisp, Previous: lisa/src/implementations/workarounds.lisp, Up: Lisp [Contents][Index]
rete (module).
Next: lisa/src/rete/node-pair.lisp, Previous: lisa/src/rete/shared-node.lisp, Up: Lisp [Contents][Index]
shared-node.lisp (file).
rete (module).
Next: lisa/src/rete/terminal-node.lisp, Previous: lisa/src/rete/successor.lisp, Up: Lisp [Contents][Index]
successor.lisp (file).
rete (module).
Next: lisa/src/rete/node1.lisp, Previous: lisa/src/rete/node-pair.lisp, Up: Lisp [Contents][Index]
node-pair.lisp (file).
rete (module).
print-object (method).
Next: lisa/src/rete/join-node.lisp, Previous: lisa/src/rete/terminal-node.lisp, Up: Lisp [Contents][Index]
terminal-node.lisp (file).
rete (module).
print-object (method).
Next: lisa/src/rete/node2.lisp, Previous: lisa/src/rete/node1.lisp, Up: Lisp [Contents][Index]
node1.lisp (file).
rete (module).
print-object (method).
Next: lisa/src/rete/node2-not.lisp, Previous: lisa/src/rete/join-node.lisp, Up: Lisp [Contents][Index]
join-node.lisp (file).
rete (module).
Next: lisa/src/rete/node2-test.lisp, Previous: lisa/src/rete/node2.lisp, Up: Lisp [Contents][Index]
node2.lisp (file).
rete (module).
Next: lisa/src/rete/node2-exists.lisp, Previous: lisa/src/rete/node2-not.lisp, Up: Lisp [Contents][Index]
node2-not.lisp (file).
rete (module).
Next: lisa/src/rete/rete-compiler.lisp, Previous: lisa/src/rete/node2-test.lisp, Up: Lisp [Contents][Index]
node2-test.lisp (file).
rete (module).
Next: lisa/src/rete/tms.lisp, Previous: lisa/src/rete/node2-exists.lisp, Up: Lisp [Contents][Index]
node2-exists.lisp (file).
rete (module).
rete-network (class).
Next: lisa/src/rete/network-ops.lisp, Previous: lisa/src/rete/rete-compiler.lisp, Up: Lisp [Contents][Index]
rete-compiler.lisp (file).
rete (module).
pass-tokens-to-successor (method).
Next: lisa/src/rete/network-crawler.lisp, Previous: lisa/src/rete/tms.lisp, Up: Lisp [Contents][Index]
tms.lisp (file).
rete (module).
Next: lisa/src/config/config.lisp, Previous: lisa/src/rete/network-ops.lisp, Up: Lisp [Contents][Index]
network-ops.lisp (file).
rete (module).
show-network (function).
Next: lisa/src/config/epilogue.lisp, Previous: lisa/src/rete/network-crawler.lisp, Up: Lisp [Contents][Index]
Previous: lisa/src/config/config.lisp, Up: Lisp [Contents][Index]
config.lisp (file).
config (module).
initial-fact (class).
Next: Definitions, Previous: Files, Up: The lisa Reference Manual [Contents][Index]
Packages are listed by definition order.
common-lisp.
Next: lisa.belief, Previous: lisa-user, Up: Packages [Contents][Index]
heap
common-lisp.
belief
common-lisp.
Next: lisa-lisp, Previous: lisa.belief, Up: Packages [Contents][Index]
common-lisp.
Next: lisa.reflect, Previous: lisa, Up: Packages [Contents][Index]
common-lisp.
Next: lisa.utils, Previous: lisa-lisp, Up: Packages [Contents][Index]
reflect
common-lisp.
Next: lisa-system, Previous: lisa.reflect, Up: Packages [Contents][Index]
utils
common-lisp.
Previous: lisa.utils, Up: Packages [Contents][Index]
Next: Indexes, Previous: Packages, Up: The lisa Reference Manual [Contents][Index]
Definitions are sorted by export status, category, package, and then by lexicographic order.
Next: Internals, Previous: Definitions, Up: Definitions [Contents][Index]
Next: Ordinary functions, Previous: Public Interface, Up: Public Interface [Contents][Index]
Macro: compose functions or macros of 1 argument into a lambda.
E.g., (compose abs (dl-val zz) ’key) ==>
(lambda (yy) (abs (funcall (dl-val zz) (funcall key yy))))
‘map-into’ the first sequence, evaluating it once. (map-in F S) == (map-into S F S)
Evaluates BODY within the context of the inference engine ENGINE. This macro is MP-safe.
lisa.
For each variable/instance pair in a query result, invoke BODY with VAR bound to the query variable and VALUE bound to the instance.
lisa.
Next: Generic functions, Previous: Macros, Up: Public Interface [Contents][Index]
lisa.
Return the list of slots of a CLASS.
CLASS can be a symbol, a class object (as returned by ‘class-of’)
or an instance of a class.
If the second optional argument ALL is non-NIL (default),
all slots are returned, otherwise only the slots with
:allocation type :instance are returned.
Returns the currently-active inference engine. Usually only invoked by code running within the context of WITH-INFERENCE-ENGINE.
lisa.
Returns that portion of SEQUENCE that occurs after ITEM, or NIL otherwise.
Returns both that portion of SEQUENCE that occurs before ITEM and the rest of SEQUENCE anchored at ITEM, or NIL otherwise.
Remove all elements from the heap, leaving it empty. Faster (& more convenient) than calling HEAP-REMOVE until the heap is empty.
Returns non-NIL if & only if the heap contains no items.
Insert a new element into the heap. Return the element (which probably
isn’t very useful).
Return the first element in the heap, but don’t remove it. It’ll be an error if the heap is empty. (Should that be an error?)
Remove the minimum (first) element in the heap & return it. It’s an error if the heap is already empty. (Should that be an error?)
Applies FUNC to each entry in hashtable HT and, if FUNC so indicates, appends the object to a LIST. If NIL is an acceptable object, then FUNC should return two values; NIL and T.
Read from STRING repeatedly, starting with START, up to MAX tokens.
Return the list of objects read and the final index in STRING.
Binds ‘*package*’ to the keyword package,
so that the bare symbols are read as keywords.
Next: Standalone methods, Previous: Ordinary functions, Up: Public Interface [Contents][Index]
lisa.
Next: Conditions, Previous: Generic functions, Up: Public Interface [Contents][Index]
Initializes a FACT instance. SLOTS is a list of slot name / value pairs,
where (FIRST SLOTS) is a symbol and (SECOND SLOT) is the slot’s
value. INSTANCE is the CLOS instance to be associated with this FACT; if
INSTANCE is NIL then FACT is associated with a template and a suitable
instance must be created; otherwise FACT is bound to a user-defined class.
Next: Classes, Previous: Standalone methods, Up: Public Interface [Contents][Index]
Previous: Conditions, Up: Public Interface [Contents][Index]
Represents a rule activation.
lisa.
:rule
This slot is read-only.
:tokens
This slot is read-only.
(incf lisa::*activation-timestamp*)
This slot is read-only.
t
This class represents ’autoloaded’ facts that are asserted automatically as part of an inference engine reset.
This class represents all facts in the knowledge base.
lisa.
-1
(make-hash-table :test (function equal))
This slot is read-only.
:belief
This slot is read-only.
This slot is read-only.
This slot is read-only.
lisa.
(make-hash-table :test (function equalp))
(make-hash-table)
(make-hash-table)
This slot is read-only.
(lisa::make-rete-network)
This slot is read-only.
-1
(list)
(make-hash-table)
This slot is read-only.
(make-hash-table :test (function equal))
(make-hash-table :test (function equal))
This slot is read-only.
(list)
0
Represents production rules after they’ve been analysed by the language parser.
lisa.
:short-name
This slot is read-only.
:comment
This slot is read-only.
0
:salience
This slot is read-only.
:context
This slot is read-only.
:auto-focus
This slot is read-only.
:behavior
:binding-set
This slot is read-only.
This slot is read-only.
(make-hash-table :test (function equal))
(list)
:patterns
This slot is read-only.
:actions
This slot is read-only.
:logical-marker
This slot is read-only.
:belief
This slot is read-only.
(make-hash-table :test (function equal))
This slot is read-only.
:engine
This slot is read-only.
lisa.
(make-array 0 :adjustable t :fill-pointer t)
0
0
(list)
This slot is read-only.
Previous: Public Interface, Up: Definitions [Contents][Index]
Next: Special variables, Previous: Internals, Up: Internals [Contents][Index]
Next: Symbol macros, Previous: Constants, Up: Internals [Contents][Index]
*The end-of-file object.
To be passed as the third arg to ‘read’ and checked against using ‘eq’.
Next: Macros, Previous: Special variables, Up: Internals [Contents][Index]
Next: Ordinary functions, Previous: Symbol macros, Up: Internals [Contents][Index]
Build and compile an anonymous function, using the body provided in FORMS.
lisa.
Define a typed constant.
Define a typed global variable.
Defines a new query identified by the symbol NAME.
lisa.
Declare an inline defun.
Make array with elements of TYPE, initializing.
Bind symbols to gensyms. First sym is a string - ‘gensym’ prefix. Inspired by Paul Graham, <On Lisp>, p. 145.
lisa.
lisa.
Next: Generic functions, Previous: Macros, Up: Internals [Contents][Index]
The alpha memory nodes and tests
lisa.
Return the list of initargs of a CLASS.
CLASS can be a symbol, a class object (as returned by ‘class-of’)
or an instance of a class.
If the second optional argument ALL is non-NIL (default),
initargs for all slots are returned, otherwise only the slots with
:allocation type :instance are returned.
Combines the certainty factors of objects matched within a single rule.
Return a copy of SEQUENCE which is EQUAL to SEQUENCE but not EQ.
lisa.
copy-seq.
Return T if the stream has no more data in it.
lisa.
lisa.
Retrieves the CLOS instance associated with a fact. FACT is a FACT instance.
Locates the META-FACT instance associated with SYMBOLIC-NAME. If ERRORP is non-nil, signals an error if no binding is found.
Given a variable, either retrieve the binding object for it or create a new one.
lisa.
Given a variable, retrieve the binding object for it.
lisa.
Supports the parsing of embedded DEFRULE forms.
lisa.
Invoke the garbage collector.
Returns a list of slot name / value pairs for every slot in a fact. FACT is a fact instance.
Return the index of the element which satisfies the predicate FNP. If there is no such element, return the fill pointer of HEAP’s array A.
Initialize the indicated heap. If INITIAL-CONTENTS is a non-empty list, the heap’s contents are intiailized to the values in that list; they are ordered according to LESS-FN. INITIAL-CONTENTS must be a list or NIL.
Initializes a fact associated with a user-created CLOS instance. The fact’s slot values are taken from the CLOS instance. FACT is a FACT instance; INSTANCE is the CLOS instance associated with this fact.
Initializes a template-bound FACT. An instance of the FACT’s associated class is created and the slots of both are synchronized from the SLOTS list. FACT is a FACT instance; SLOTS is a list of symbol/value pairs.
Sets the value of a slot in a fact’s slot table. FACT is a FACT instance; SLOT-NAME is a symbol; VALUE is the slot’s new value.
Is every variable in a pattern ’local’; i.e. does not reference a binding in a previous pattern?
lisa.
Return the index of the lesser child. If there’s one child, return its index. If there are no children, return (FILL-POINTER (HEAP-A HEAP)).
The default constructor for class FACT. NAME is the symbolic fact name as used in rules; SLOTS is a list of symbol/value pairs.
A constructor for class FACT that creates an instance bound to a user-defined CLOS instance. NAME is the symbolic fact name; CLOS-INSTANCE is a user-supplied CLOS object.
Creates a FACT instance using another FACT instance as a
template. Basically a clone operation useful for such things as asserting
DEFFACTS.
lisa.
lisa.
Parses a single slot constraint, eg. (slot-name ?var 1) or (slot-name ?var (equal ?var 1))
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
Private. Move the HOLE down until it’s in a location suitable for X. Return the new index of the hole.
Private. Moves the HOLE until it’s in a location suitable for holding
X. Does not actually bind X to the HOLE. Returns the new
index of the HOLE. The hole itself percolates down; it’s the X
that percolates up.
lisa.
A useful default for required arguments and DEFSTRUCT slots.
lisa.
lisa.
Runs a query (RULE instance), and returns both the value of *QUERY-RESULT* and the query name itself.
lisa.
Assigns to a slot the value from the corresponding slot in the fact’s CLOS instance. FACT is a FACT instance; META-FACT is a META-FACT instance; INSTANCE is the fact’s CLOS instance; SLOT-NAME is a symbol representing the affected slot.
Assigns a new value to a slot in a fact and its associated CLOS instance. SLOT-NAME is a symbol; VALUE is the new value for the slot.
lisa.
lisa.
Is the slot value a simple constraint?
lisa.
Is the slot value a simple negated constraint?
lisa.
Is the slot value a Lisa variable?
lisa.
Makes a fact’s slot values and its CLOS instance’s slot values match. If a slot identifier is provided then only that slot is synchronized. FACT is a FACT instance; EFFECTIVE-SLOT, if supplied, is a symbol representing the CLOS instance’s slot.
Next: Conditions, Previous: Ordinary functions, Up: Internals [Contents][Index]
lisa.
lisa.
lisa.
lisa.
automatically generated reader method
lisa.
automatically generated writer method
lisa.
lisa.
automatically generated reader method
rule.
lisa.
automatically generated reader method
lisa.
automatically generated reader method
lisa.
lisa.
lisa.
lisa.
mesg.
mesg.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
automatically generated reader method
heap.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
automatically generated reader method
lisa.
lisa.
lisa.
lisa.
lisa.
lisa.
automatically generated reader method
lisa.
automatically generated reader method
lisa.
automatically generated writer method
lisa.
automatically generated reader method
lisa.
lisa.
automatically generated reader method
rule.
lisa.
lisa.
lisa.
text.
Next: Structures, Previous: Generic functions, Up: Internals [Contents][Index]
An error in a case statement.
This carries the function name which makes the error message more useful.
code.
lisa.
An error in the user code.
error.
Your implementation does not support this functionality.
lisa.
error.
lisa.
lisa.
Next: Classes, Previous: Conditions, Up: Internals [Contents][Index]
Represents the canonical form of a pattern analysed by the DEFRULE parser.
lisa.
structure-object.
common-lisp.
symbol
integer
0
list
list
symbol
list
common-lisp.
symbol
:generic
Represents the canonical form of a slot within a pattern analysed by the DEFRULE parser.
lisa.
structure-object.
symbol
list
symbol
symbol
list
Next: Types, Previous: Structures, Up: Internals [Contents][Index]
A breadth-first conflict resolution strategy.
lisa.
A base class for all LISA builtin conflict resolution strategies.
lisa.
A depth-first conflict resolution strategy.
lisa.
lisa.
This slot is read-only.
(list)
(make-hash-table :test (function equal))
This slot is read-only.
(make-hash-table :test (function equal))
This slot is read-only.
lisa.
Serves as the base class for all classes implementing conflict resolution strategies.
lisa.
Previous: Definitions, Up: The lisa Reference Manual [Contents][Index]
Jump to: | %
(
A B C D E F G H I J L M N P Q R S T U V W |
---|