On Sat, Jan 7, 2012 at 11:20 PM, jim wrote:
> Hey David,
>
> From the readme the failing disequality example:
>
> (run* [q]
> (fresh [x y]
>(!= [x 2] [1 y])
>(== x 1)
>(== y 2)
>(== q [x y])))
>
> gives me ([1 2])
>
I just checked t
Thanks for report. Please open a ticket. I'll look into this later this
week.
David
On Saturday, January 7, 2012, jim wrote:
> Hey David,
>
> From the readme the failing disequality example:
>
> (run* [q]
> (fresh [x y]
>(!= [x 2] [1 y])
>(== x 1)
Hi
On 8 January 2012 06:20, jim wrote:
> Hey David,
>
> From the readme the failing disequality example:
>
> (run* [q]
> (fresh [x y]
> (!= [x 2] [1 y])
> (== x 1)
> (== y 2)
> (== q [x y])))
>
> gives me ([1 2])
>
> Shouldn't it be:
&g
Hey David,
>From the readme, the failing disequality example:
(run* [q]
(fresh [x y]
(!= [x 2] [1 y])
(== x 1)
(== y 2)
(== q [x y])))
gives me ([1 2])
Shouldn't it be:
(run* [q]
(fresh [x y]
(!= [x 2] [1 y])
(== x 1)
(== y 2)
(== q [x y])))
Hey David,
>From the readme the failing disequality example:
(run* [q]
(fresh [x y]
(!= [x 2] [1 y])
(== x 1)
(== y 2)
(== q [x y])))
gives me ([1 2])
Shouldn't it be:
(run* [q]
(fresh [x y]
(!= [x 2] [1 y])
(== x 1)
(== y 2)
(== q [x y])))
On Mon, Apr 11, 2011 at 2:01 PM, Vagif Verdi wrote:
> Can it be used as an inference (rule) engine ?
You can now -
(defrel man p)
(fact man 'Bob)
(fact man 'John)
(fact man 'Ricky)
(defrel woman p)
(fact woman 'Mary)
(fact woman 'Martha)
(fact woman 'Lucy)
(defrel likes p1 p2)
(fact likes '
On Mon, Apr 11, 2011 at 2:01 PM, Vagif Verdi wrote:
> Can it be used as an inference (rule) engine ?
If you mean in the same way that you can build inference (rule) engines in
Prolog - I don't see why not.
However there is a bit of work to be done in order to make building
efficient rule engin
?x ?x1)))
> (noattack-o [?x ?y] ?others
>
> The big changes are:
>
> * Pattern matching
> * Goals can be tabled a la XSB
> * Fairly efficient implementation of disequality constraints (and programs
> w/o constraints are not penalized)
>
> I've been begun port
On Sun, Apr 10, 2011 at 6:11 AM, faenvie wrote:
> very interesting stuff. i will follow this with pleasure ...
>
> to get into it, a basic tutorial that focuses on solving
> one or two classical problems using logos would
> probably be a winner.
Thanks. A tutorial is definitely planned.
David
very interesting stuff. i will follow this with pleasure ...
to get into it, a basic tutorial that focuses on solving
one or two classical problems using logos would
probably be a winner.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post
Fascinating!
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - please be patient with your
first post.
To unsubscribe from this group, send e
?y1 ?x ?x1]
(!= (- ?y1 ?y) (- ?x1 ?x))
(!= (- ?y1 ?y) (- ?x ?x1)))
(noattack-o [?x ?y] ?others
The big changes are:
* Pattern matching
* Goals can be tabled a la XSB
* Fairly efficient implementation of disequality constraints (and programs
w/o c
12 matches
Mail list logo
