lisa-users Mailing List for Intelligent Agents for Lisp
Brought to you by:
youngde
You can subscribe to this list here.
2000 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
(2) |
Dec
|
---|---|---|---|---|---|---|---|---|---|---|---|---|
2001 |
Jan
|
Feb
|
Mar
(4) |
Apr
(5) |
May
(16) |
Jun
(19) |
Jul
|
Aug
(6) |
Sep
(1) |
Oct
(2) |
Nov
(1) |
Dec
|
2002 |
Jan
(1) |
Feb
|
Mar
|
Apr
(7) |
May
(1) |
Jun
(2) |
Jul
(2) |
Aug
(4) |
Sep
(2) |
Oct
(4) |
Nov
(6) |
Dec
(6) |
2003 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(1) |
Oct
|
Nov
(1) |
Dec
|
2004 |
Jan
|
Feb
|
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(10) |
Oct
(8) |
Nov
|
Dec
|
2005 |
Jan
|
Feb
(3) |
Mar
|
Apr
|
May
(9) |
Jun
|
Jul
(13) |
Aug
(5) |
Sep
(14) |
Oct
|
Nov
|
Dec
|
2006 |
Jan
(2) |
Feb
(7) |
Mar
(7) |
Apr
(2) |
May
|
Jun
|
Jul
(7) |
Aug
|
Sep
|
Oct
(2) |
Nov
|
Dec
|
2008 |
Jan
|
Feb
|
Mar
(10) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(2) |
Nov
|
Dec
|
2009 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
(1) |
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2021 |
Jan
|
Feb
(1) |
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
From: George W. <geo...@po...> - 2021-02-06 17:36:34
|
Is anyone still out there? There doesn't seem to have been any activity on this list for over ten years, and the LISA author (David Young, <yo...@po...>) hasn't responded to my email. In any case, I'm announcing that I've created a new clone of LISA at https://github.com/gpwwjr/LISA, which includes porting LISA to Clozure CL, some minor bug fixes, a few new minor features, and some updates to the documentation. I'd be very interested to get feedback from anyone out there who is still interested in LISA. Regards, --george George P. Williams |
From: Johan L. <joh...@gm...> - 2009-06-02 08:01:50
|
Hi Steve, > I'm in the process of benchmarking a few of the popular rules engines, > mostly Java based, but also ART*Enterprise and CLIPS. Previous benchmarks > can be found here: > http://illation.com.au/benchmarks > I'm an old ART user, so just for fun I thought it would be interesting to > include benchmarks for LISA. Is there anyone out there interested in working > with me to developing a testing framework and running some benchmarks? I'll bite. I'm kind of interested in your benchmarks anyway and I think it's a great job you're doing so I'd be happy to help in any way I can. Which ones do you plan to run and which Lisp implementation are you using? BR Johan Lindberg jo...@pu... |
From: Nunez S. <ste...@ya...> - 2009-05-27 08:35:13
|
Greetings All, I'm in the process of benchmarking a few of the popular rules engines, mostly Java based, but also ART*Enterprise and CLIPS. Previous benchmarks can be found here: http://illation.com.au/benchmarks I'm an old ART user, so just for fun I thought it would be interesting to include benchmarks for LISA. Is there anyone out there interested in working with me to developing a testing framework and running some benchmarks? Regards, - Steve |
From: <kro...@gm...> - 2008-10-24 20:21:45
|
I found the solution: not to use quotes in the slots. for the record, the full solution is here: http://paste.lisp.org/display/69135#2 sorry about the noise. pedro |
From: <kro...@gm...> - 2008-10-24 19:59:02
|
hi, I'm working my way thought Giarratano and Riley's "Expert Systems Principles and Practice" and converting the clips examples to lisa. there is an example that uses multislots to match the names of people. the pattern in the rule is: (person (name ?name) (children $?before ?child $?after)) I tried something like the following but it does not work (there is no match): (person (name ?name) (children ?children (member ?child ?children))) my attempt to translate it to lisa is here: http://paste.lisp.org/display/69135 and the original clisp in here: http://paste.lisp.org/display/69135#1 what am I doing wrong? Pedro |
From: <kro...@gm...> - 2008-03-26 23:12:35
|
"Johan Lindberg" <joh...@gm...> writes: > The problem, as you have already figured out, lies in that there are > no multislots in Lisa. thanks for your answer. At first I thought that if I put a list in a slot it was a 'multislot'. now I see that's not the case. > Personally I think you should define a template for each of the > implied facts, not only is it more readable, it is also faster. > Mutlislots are terribly slow in CLIPS. I love them because they allow > me to express a pattern match very clearly and concisely but I hate > them because whenever I pour in a few thousand facts matching such a > rule I might as well call it a day. I agree. I think they can be easily converted in this example, I suppose the only thing that will be more verbose is to translate this sequence: (defrule generate-combinations ?f <- (value ?s ?e) => (retract ?f) (assert (avh (a ?s) (v ?e) (h 1)) (avh (a ?s) (v ?e) (h 2)) (avh (a ?s) (v ?e) (h 3)) (avh (a ?s) (v ?e) (h 4)) (avh (a ?s) (v ?e) (h 5)))) where ?a would have to match a slot name in the new code. Pedro |
From: Ramarren <ram...@gm...> - 2008-03-26 11:05:15
|
Hello, While trying to load CVS Lisa into SBCL it gave me package-lock errors, so I started reading the code to try and fix that. When I was doing I also noticed that OR patterns from previous versions are no longer present, and added them, if in a bit hackish way. I also made few other small changes. I published them in a git fork at http://github.com/Ramarren/lisa/tree/master . Since I don't have any project which could actually use such a system I can't really do any serious testing, but I hope this will be useful for somebody. Ramarren |
From: Johan L. <joh...@gm...> - 2008-03-24 16:50:37
|
Hi Pedro, I really meant to reply to your previous post earlier but I completely forgot, I am sorry. I ran into this (or at least a very similar) problem a few months ago when I was comparing CLIPS and Lisa. The problem, as you have already figured out, lies in that there are no multislots in Lisa. This will make it difficult for you to do a direct translation of the puzzle. If you assert a list in a slot you can either match it as-is or provide your own comparison function. See http://commentsarelies.blogspot.com/2007/10/another-clips-and-lisa-comparison.html for an example. Personally I think you should define a template for each of the implied facts, not only is it more readable, it is also faster. Mutlislots are terribly slow in CLIPS. I love them because they allow me to express a pattern match very clearly and concisely but I hate them because whenever I pour in a few thousand facts matching such a rule I might as well call it a day. Good luck Johan Lindberg jo...@pu... |
From: <kro...@gm...> - 2008-03-24 14:59:21
|
kro...@gm... (Pedro Kröger) writes: > How do I represent this in lisa? none of these work: > > (?f1 (solution (data '(nationality ?n1 1)))) > (?f1 (solution (data (list nationality ?n1 1)))) > (?f1 (solution (data (nationality ?n1 1)))) For example, using (?f1 (solution (data '(nationality ?n1 1)))) gives me this error: Rule parsing error: rule name PRINT-SOLUTION, pattern location 0 (malformed slot) [Condition of type LISA::RULE-PARSING-ERROR] Restarts: 0: [ABORT] Abort SLIME compilation. 1: [ABORT] Return to SLIME's top level. 2: [TERMINATE-THREAD] Terminate this thread (#<THREAD "worker" {B75CE31}>) Backtrace: 0: (LISA::PARSE-ONE-SLOT (DATA (QUOTE (NATIONALITY ?N1 1))) 0) 1: (LISA::PARSE-GENERIC-PATTERN (SOLUTION (DATA (QUOTE #))) 0 ?F1) The manual says that this is valid: (fact-with-list (list '(1 2 three))) so, at least I shouldn't get a "rule-parsing-error" (even if the logical variables are not recognized because of the quote). Pedro |
From: <kro...@gm...> - 2008-03-17 10:08:33
|
Hi, To learn more about lisa and rule-based systems I'm converting the zebra puzzle from clips to lisa. the original is here [1] and my in-progress transcription is in [2]. The question I have is, AFAICT in the original, the expression: (assert (value color red)) automatically creates a template "value" with a hidden multislot with color and red as values. In jess the multislot is __data. In my code I have: (assert (value (data '(color red)))) The original also has: ?f1 <- (solution nationality ?n1 1) How do I represent this in lisa? none of these work: (?f1 (solution (data '(nationality ?n1 1)))) (?f1 (solution (data (list nationality ?n1 1)))) (?f1 (solution (data (nationality ?n1 1)))) I appreciate any suggestions and criticisms to my code. Pedro [1] http://www.inf.u-szeged.hu/~jelasity/migyak/zebra.clp [2] http://paste.lisp.org/display/57484 |
From: <kro...@gm...> - 2008-03-14 23:59:48
|
"Johan Lindberg" <joh...@gm...> writes: > The reason for the infinite loop is because LISA handles refraction > and modifications just like CLIPS. [snip] > In general (using CLIPS, and LISA) you should include a match against > the slot your modifying to make sure that it's not already been > processed to avoid this sort of trouble. thanks for helping me, it works. I'm glad to know that LISA works like CLIPS since I just received Giarratano's "Expert Systems: principles and programming" :-) Pedro |
From: Johan L. <joh...@gm...> - 2008-03-14 16:46:20
|
Hi again Pedro, > but what I want to do is to change the slots of each instance. I tried > the following code but I get a infinite loop: > > (defrule rule-1 () > (?sonority (sonority (notes ?notes))) > => > (modify ?sonority (tertian-p t))) The reason for the infinite loop is because LISA handles refraction and modifications just like CLIPS. While it won't place an Activation (a Rule + a set of Facts) on the Agenda if it has been executed before (aka Refraction). The problem is that the modify statement changes the Fact-index (of the ?sonority fact) and that also means that LISA will treat it as a "new" Fact. It won't show up on the list of previous Activations so Refraction won't work. Some engines (Jess) handle this type of situation a little better. Jess won't assign a new Fact-index unless the modify statement actually modifies a slot-value. It makes it easier to avoid this problem or it encourages you to write sloppy code, depends on how you look at it ;-) The easiest way to solve your problem is to modify the LHS so that it also matches (tertian-p nil). Try: (defrule rule-1 () (?sonority (sonority (notes ?notes) (tertian-p nil))) => (modify ?sonority (tertian-p t))) In general (using CLIPS, and LISA) you should include a match against the slot your modifying to make sure that it's not already been processed to avoid this sort of trouble. HTH Johan Lindberg jo...@pu... |
From: <kro...@gm...> - 2008-03-13 15:40:10
|
Hi, As I wrote in the other email, my system will be analyzing chords ("sonorities") in a list. For now I decided to make a clos instance for each sonority and put each of them in a list while I'm learning how to write the rules, etc. The code in http://paste.lisp.org/display/57289 is an oversimplification of what I'm trying to do, but it's simpler to read then the one I'm really writing. I'm creating 2 instances, one for each chord, in a list and asserting them with loop: (loop for ?s in *sonorities* do (assert (?s))) rule-1 is a just for testing. it matches ok for both versions in: http://paste.lisp.org/display/57289#1 (the result of running (test) with (watch :all) is in) http://paste.lisp.org/display/57289#3 but what I want to do is to change the slots of each instance. I tried the following code but I get a infinite loop: (defrule rule-1 () (?sonority (sonority (notes ?notes))) => (modify ?sonority (tertian-p t))) So, after runing (test) I should get (T T) after evaluating: (mapcar #'tertian-p *sonorities*) Any ideas? Pedro |
From: <kro...@gm...> - 2008-03-13 12:33:00
|
"Johan Lindberg" <joh...@gm...> writes: > Salience is the simplest (and crudest) way to control the order of > execution and just might do the trick for you. Assign a lower salience > (-10 or something) to the rules that require the previous chord to > have been analyzed first and run your program to see if the rules are > executed in the correct order. thanks, I'll try salience and see if it works. Pedro |
From: <kro...@gm...> - 2008-03-06 10:01:09
|
Hi, I'm implementing a rule-based system (using lisa) for harmonic analysis of tonal music based on Harry John Maxwell's "An Artificial Intelligence Approach To Computer-Implemented Analysis Of Harmony In Tonal Music". I have a list of sonorities, which is a collection of notes that may or may not be a chord (one of the jobs of the system is to discover it). Most rules deal with one sonority, so my first thought was to have a loop and run the system independently for each sonority. But there are rules that depend on the analysis of previous and next sonorities. An example is: Rule 37. If the previous chord has not been analyzed, then defer analysis of this chord until the previous chord is done. Is there a rule-based solution to this, or should I put the sonorities in a list and ask the system to analyze the n+1 or n-1 element in the list as usual in imperative code? I'm new to rule-based systems, so I appreciate any pointers. I'm reading "Jess in action" since the syntax is similar to lisa's. Regards, Pedro Kroger |
From: Paolo A. <am...@mc...> - 2006-10-12 09:56:01
|
Kaveh Kardan <ka...@ha...> writes: > Do the "facts" of the system have to be CLOS classes or templates? Facts can be both CLOS instances and Lisa templates. I guess that templates are better for simple facts or "legacy" rules (e.g. when porting from CLIPS/JESS), and CLOS instances for more complex cases. > Is it possible to have LISA do inference over facts expressed as > thunks or arbitrary lisp expressions? Not directly, but you could created CLOS classes or Lisa templates with slots containing the required thunks, and use test patterns for matching if necessary. > For example, I have a movie scene, and I am developing a system for > automatically placing the camera to best shoot the scene. I would > like to be able to express rules such as the following: > > (defrule rule-1 (:cf 0.8) > (is-first-shot-of *scene*) > => > (make-establishing-shot *scene*)) What is is-first-shot-of? A function? If so, you could use something like (untested, no pun intended): (defrule rule-1 (:cf 0.8) (test (is-first-shot-of *scene*)) => (make-establishing-shot *scene*)) > Also, how would one best express things such as the following as a rule? > > (let ((actor-1 (current-subject *scene*)) > (actor-2 (non-current-subject *scene*))) > (if (> (viewer-identification-with actor-1) > (viewer-identification-with actor-2)) > (make-closeup-shot actor-1) > (make-over-the-shoulder-shot actor-1))) You may express the LET bindings with object/template matching, using variables and tests if necessary. > pointers to articles or texts with a practical bent would be > appreciated. See: LISA and rule-based programming in Common Lisp http://www.paoloamoroso.it/log/050827.html Paolo -- Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log |
From: Kaveh K. <ka...@ha...> - 2006-10-12 05:01:20
|
Greetings, Please forgive this very basic question. Do the "facts" of the system have to be CLOS classes or templates? Is it possible to have LISA do inference over facts expressed as thunks or arbitrary lisp expressions? For example, I have a movie scene, and I am developing a system for automatically placing the camera to best shoot the scene. I would like to be able to express rules such as the following: (defrule rule-1 (:cf 0.8) (is-first-shot-of *scene*) => (make-establishing-shot *scene*)) Also, how would one best express things such as the following as a rule? (let ((actor-1 (current-subject *scene*)) (actor-2 (non-current-subject *scene*))) (if (> (viewer-identification-with actor-1) (viewer-identification-with actor-2)) (make-closeup-shot actor-1) (make-over-the-shoulder-shot actor-1))) I obviously am just starting investigating rule-based systems, so pointers to articles or texts with a practical bent would be appreciated. Regards, Kaveh |
From: Paolo A. <am...@mc...> - 2006-07-30 16:19:08
|
I have just posted to my blog a short note on a misunderstanding I had about Lisa's behavior: Lisa rules check fact slot names, not CLOS accessors http://www.paoloamoroso.it/log/060730.html Paolo -- Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log |
From: David Y. <you...@gm...> - 2006-07-24 14:26:22
|
The code in CVS head is often unstable; the safest way to get Lisa is via the official release. I want to do a 2.5 version soon. dey On 7/24/06, Ralf Mattes <rm...@mh...> wrote: > > On Sun, 09 Jul 2006 08:55:06 -0400, David Young wrote: > > > Correct. In fact, I have more to check in that should resolve this > issue. > > Directory 2.0 core is deprecated and will disappear for the next > release. > > I'll try and do an updated version some time this week. Thanks for the > > report. > > > > What's the status of this bug? It seems to still be in a recent > (yesterday) CVS checkout. > > TIA Ralf Mattes > > > david > > > > > > On 7/9/06, Paolo Amoroso <am...@mc...> wrote: > >> > >> Building Lisa from latest CVS sources breaks because the definition of > >> module "config" references file "epilogue" (src/config/epilogue.lisp), > >> which does not--no longer?--exist. The build procedure works again by > >> removing that reference. > >> > >> There are two more files named "epilogue.lisp": > >> > >> src/2.0-core/epilogue.lisp > >> src/core/epilogue.lisp > >> > >> Are they unrelated to the one mentioned by the "config" module? > >> > >> > >> Paolo > >> -- > >> Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log > >> > >> > >> > ------------------------------------------------------------------------- > >> Using Tomcat but need to do more? Need to support web services, > >> security? Get stuff done quickly with pre-integrated technology to make > >> your job easier > >> Download IBM WebSphere Application Server v.1.0.1 based on Apache > >> Geronimo > >> > http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 > >> _______________________________________________ Lisa-users mailing list > >> Lis...@li... > >> https://lists.sourceforge.net/lists/listinfo/lisa-users > >> > > > > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > opinions on IT & business topics through brief surveys -- and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > _______________________________________________ > Lisa-users mailing list > Lis...@li... > https://lists.sourceforge.net/lists/listinfo/lisa-users > -- And now these three remain: faith, hope, and love. But the greatest of these is love. -- 1 Corinthians 13:13 For wisdom is more precious than rubies, and nothing you desire can compare with her. -- Proverbs 8:11 |
From: Ralf M. <rm...@mh...> - 2006-07-24 09:28:59
|
On Sun, 09 Jul 2006 08:55:06 -0400, David Young wrote: > Correct. In fact, I have more to check in that should resolve this issue. > Directory 2.0 core is deprecated and will disappear for the next release. > I'll try and do an updated version some time this week. Thanks for the > report. > What's the status of this bug? It seems to still be in a recent (yesterday) CVS checkout. TIA Ralf Mattes > david > > > On 7/9/06, Paolo Amoroso <am...@mc...> wrote: >> >> Building Lisa from latest CVS sources breaks because the definition of >> module "config" references file "epilogue" (src/config/epilogue.lisp), >> which does not--no longer?--exist. The build procedure works again by >> removing that reference. >> >> There are two more files named "epilogue.lisp": >> >> src/2.0-core/epilogue.lisp >> src/core/epilogue.lisp >> >> Are they unrelated to the one mentioned by the "config" module? >> >> >> Paolo >> -- >> Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log >> >> >> ------------------------------------------------------------------------- >> Using Tomcat but need to do more? Need to support web services, >> security? Get stuff done quickly with pre-integrated technology to make >> your job easier >> Download IBM WebSphere Application Server v.1.0.1 based on Apache >> Geronimo >> http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 >> _______________________________________________ Lisa-users mailing list >> Lis...@li... >> https://lists.sourceforge.net/lists/listinfo/lisa-users >> |
From: Paolo A. <am...@mc...> - 2006-07-10 19:07:43
|
"Young, David" <de...@bl...> writes: > The safest thing to do is use just the offical releases. Lisa's cvs archive > is often unstable, I'm afraid. Sorry about that. The official Lisa 2.4 release works fine, thanks. Paolo -- Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log |
From: Paolo A. <am...@mc...> - 2006-07-10 18:30:17
|
It looks like the latest CVS sources break existing code based on Lisa. First, package LISA-LISP is no longer available, and I think that package LISA should be used instead. Also, when loading the compiled mab-clos.lisp demo, I get this error with CMUCL Snapshot 2006-06 (19C) under Slackware Linux (the error is from a SLIME backtrace): Rule parsing error: rule name HOLD-CHEST-TO-PUT-ON-FLOOR, pattern location 2 [Condition of type LISA::RULE-PARSING-ERROR] Restarts: 0: [CONTINUE] Return NIL from load of "mab-clos". 1: [ABORT-REQUEST] Abort handling SLIME request. 2: [ABORT] Return to Top-Level. Backtrace: 0: (LISA::PARSE-ONE-SLOT (HOLDING (NOT ?CHEST)) 2) 1: (LISA::PARSE-GENERIC-PATTERN (MONKEY (HOLDING #)) 2 NIL) 2: ((LABELS LISA::PARSE-LHS LISA::PARSE-RULE-BODY) ((MONKEY #) (NOT #))) 3: ((LABELS LISA::PARSE-LHS LISA::PARSE-RULE-BODY) ((THING # # #) (MONKEY #) (NOT #))) 4: ((LABELS LISA::PARSE-LHS LISA::PARSE-RULE-BODY) ((GOAL-IS-TO # #) (THING # # #) (MONKEY #) (NOT #))) 5: (LISA::PARSE-RULE-BODY ((GOAL-IS-TO # #) (THING # # #) (MONKEY #) (NOT #) => ...)) 6: (LISA::DEFINE-RULE HOLD-CHEST-TO-PUT-ON-FLOOR ((GOAL-IS-TO # #) (THING # # #) (MONKEY #) (NOT #) => ...) :SALIENCE 0 ...) 7: (C::DO-CALL #<Code Object "Top-Level Form" {58AEC767}> 90 91 4 ...) 8: (LISP::FOP-FUNCALL-FOR-EFFECT) 9: (LISP::LOAD-GROUP #<Stream for file "/home/paolo/src/lisa/misc/mab-clos.x86f">) 10: (LISP::FASLOAD #<Stream for file "/home/paolo/src/lisa/misc/mab-clos.x86f">) 11: (LISP::INTERNAL-LOAD #P"/home/paolo/src/lisa/misc/mab-clos.x86f" #P"/home/paolo/src/lisa/misc/mab-clos.x86f" :ERROR :BINARY) 12: (LOAD "mab-clos" :VERBOSE NIL :PRINT ...) --more-- Any changes in the Lisa syntax? Paolo -- Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log |
From: David Y. <you...@gm...> - 2006-07-09 12:55:09
|
Correct. In fact, I have more to check in that should resolve this issue. Directory 2.0 core is deprecated and will disappear for the next release. I'll try and do an updated version some time this week. Thanks for the report. david On 7/9/06, Paolo Amoroso <am...@mc...> wrote: > > Building Lisa from latest CVS sources breaks because the definition of > module "config" references file "epilogue" (src/config/epilogue.lisp), > which does not--no longer?--exist. The build procedure works again by > removing that reference. > > There are two more files named "epilogue.lisp": > > src/2.0-core/epilogue.lisp > src/core/epilogue.lisp > > Are they unrelated to the one mentioned by the "config" module? > > > Paolo > -- > Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log > > > ------------------------------------------------------------------------- > Using Tomcat but need to do more? Need to support web services, security? > Get stuff done quickly with pre-integrated technology to make your job > easier > Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo > http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 > _______________________________________________ > Lisa-users mailing list > Lis...@li... > https://lists.sourceforge.net/lists/listinfo/lisa-users > -- And now these three remain: faith, hope, and love. But the greatest of these is love. -- 1 Corinthians 13:13 For wisdom is more precious than rubies, and nothing you desire can compare with her. -- Proverbs 8:11 |
From: Paolo A. <am...@mc...> - 2006-07-09 11:43:24
|
Building Lisa from latest CVS sources breaks because the definition of module "config" references file "epilogue" (src/config/epilogue.lisp), which does not--no longer?--exist. The build procedure works again by removing that reference. There are two more files named "epilogue.lisp": src/2.0-core/epilogue.lisp src/core/epilogue.lisp Are they unrelated to the one mentioned by the "config" module? Paolo -- Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log |
From: Paolo A. <am...@mc...> - 2006-04-07 18:35:03
|
"David Young" <you...@gm...> writes: > I'm going to be working on Lisa a bit for awhile (occasionally). Initially I > had considered adding backward-chaining to the project, but I've decided > against that for the time being. Here's what I'll be doing: I don't currently have a need for a backward chaining system, but I'm curious about your decision to delay its implementation. Is it because of time constraints or because of technical reasons? > This will probably constitute Lisa 3.0. If you have any other suggestions, > post here and I'll consider them. Thanks. Sounds great. Paolo -- Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log |