Powerloom, a first stab...
Gerard Toonstra <[email protected]> Thu, 25 Mar 2010 14:29:06 +0000
| Newsgroups | gmane.comp.ai.powerloom |
|---|---|
| Message-ID | <[email protected]> |
--===============1922962852==
Content-Type: multipart/alternative;
boundary="_3737e361-c77a-4b64-bd17-eb1b59c39609_"
--_3737e361-c77a-4b64-bd17-eb1b59c39609_
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
Hi there=2C
I'm currently evaluating powerloom for research in the context of an agent =
platform.
I've read through all documentation of powerloom so far and I think it's ce=
rtainly powerful enough
to use it for our purposes=2C certainly for all the standard logic.=20
I do have a question however on producing solutions and alternatives. The o=
nly recursion=20
example I found in Powerloom used transitivity rules (parent/ancestor examp=
le and the RCC8 KB).
Unfortunately=2C my problem cannot be used with transitivity.
The problem I have is:
- Someone states input need X.
- Programs provide one single output
- In order to produce the output=2C a program may have 0-n input needs=2C w=
hich need to be resolved
with outputs from other programs.
- Those programs providing these outputs in their turn may have 0-n input n=
eeds themselves.
The required output is a list of acceptable solutions that=2C in their comb=
ination=2C can provide
the output. I imagine that the only way to do this properly is through recu=
rsion somehow.
I do however have two alternatives there:=20
- I can do this in Java and just maintain the tree myself
- I may be able to rely on Powerloom to produce these alternatives=2C but I=
don't know what to look for.
(many instances of programs may exist=2C so including a similar instance=
is actually a different solution).
So that's the question basically. Can powerloom produce a list of entities =
that together form the solution=2C
based on some constraints that are set on the production of this list and p=
resent each acceptable=2C but minimal=20
solution individually? I'm not asking for a piece of code=2C just what I n=
eed to look for to realize this.
Rgds=2C
G>
=20
_________________________________________________________________
Hotmail is redefining busy with tools for the New Busy. Get more from your =
inbox.
http://www.windowslive.com/campaign/thenewbusy?ocid=3DPID27925::T:WLMTAGL:O=
N:WL:en-US:WM_HMP:032010_2=
--_3737e361-c77a-4b64-bd17-eb1b59c39609_
Content-Type: text/html; charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<html>
<head>
<style><!--
.hmmessage P
{
margin:0px=3B
padding:0px
}
body.hmmessage
{
font-size: 10pt=3B
font-family:Verdana
}
--></style>
</head>
<body class=3D'hmmessage'>
<pre><br>Hi there=2C<br><br>I'm currently evaluating powerloom for research=
in the context of an agent platform.<br><br>I've read through all document=
ation of powerloom so far and I think it's certainly powerful enough<br>to =
use it for our purposes=2C certainly for all the standard logic. <br>I do h=
ave a question however on producing solutions and alternatives. The only re=
cursion <br>example I found in Powerloom used transitivity rules (parent/an=
cestor example and the RCC8 KB).<br>Unfortunately=2C my problem cannot be u=
sed with transitivity.<br><br>The problem I have is:<br><br>- Someone state=
s input need X.<br>- Programs provide one single output<br>- In order to pr=
oduce the output=2C a program may have 0-n input needs=2C which need to be =
resolved<br> with outputs from other programs.<br>- Those programs providi=
ng these outputs in their turn may have 0-n input needs themselves.<br><br>=
<br>The required output is a list of acceptable solutions that=2C in their =
combination=2C can provide<br>the output. I imagine that the only way to do=
this properly is through recursion somehow.<br>I do however have two alter=
natives there: <br>- I can do this in Java and just maintain the tree mysel=
f<br>- I may be able to rely on Powerloom to produce these alternatives=2C =
but I don't know what to look for.<br> (many instances of programs may ex=
ist=2C so including a similar instance is actually a different solution).<b=
r><br><br>So that's the question basically. Can powerloom produce a list of=
entities that together form the solution=2C<br>based on some constraints t=
hat are set on the production of this list and present each acceptable=2C b=
ut minimal <br>solution individually? I'm not asking for a piece of code=
=2C just what I need to look for to realize this.<br><br><br>Rgds=2C<br><br=
>G>=3B<br><br></pre> <br /><hr />Hotmail is redefining busy wi=
th tools for the New Busy. Get more from your inbox. <a href=3D'http://www.=
windowslive.com/campaign/thenewbusy?ocid=3DPID27925::T:WLMTAGL:ON:WL:en-US:=
WM_HMP:032010_2' target=3D'_new'>Sign up now.</a></body>
</html>=
--_3737e361-c77a-4b64-bd17-eb1b59c39609_--
--===============1922962852==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
_______________________________________________
powerloom-forum mailing list
[email protected]
http://mailman.isi.edu/mailman/listinfo/powerloom-forum
--===============1922962852==--