http://github.com/clojure/core.logic/commit/ef437d676e72dd9a30e60b31d8ee4a1dccbfdcef
Finally tabled goals are reset upon every run!
The old behavior is no longer supported - I'm not even sure that behavior
was ever the true intent of the original miniKanren tabling design.
Should the old behavio
On Fri, Oct 19, 2012 at 11:47 AM, Coen De Roover wrote:
> Hi David,
>
> What are your plans about the tables?
> I would side with the title of the issue rather than its description :)
>
I don't have any current plans to further improve the performance of
tabling. The only thing I am looking to f
On 17 Oct 2012, at 19:31, David Nolen wrote:
> On Mon, Oct 8, 2012 at 10:00 AM, Reinout Stevens wrote:
> Another question: is it possible to manually reset the contents of the tables?
>
>
> Thanks a lot
>
>
> Reinout
>
> After some more thinking, I agree that the current behavior is not on
On Mon, Oct 8, 2012 at 10:00 AM, Reinout Stevens wrote:
> Another question: is it possible to manually reset the contents of the
> tables?
>
>
> Thanks a lot
>
>
> Reinout
>
After some more thinking, I agree that the current behavior is not only
counter intuitive, but simply awful :)
http://dev
On Monday, October 8, 2012, Reinout Stevens wrote:
>
>
>
> On Saturday, October 6, 2012 1:53:42 AM UTC+2, David Nolen wrote:
>>
>> On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens wrote:
>>>
>>> Hi,
>>>
>>>
>>> I quickly changed the code so that the graph structure no longer contains
>>> the list
On Saturday, October 6, 2012 1:53:42 AM UTC+2, David Nolen wrote:
>
> On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens
>
> > wrote:
>
>> Hi,
>>
>>
>> I quickly changed the code so that the graph structure no longer contains
>> the list of nodes, and the same behaviour still persists. For the ac
On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens wrote:
> Hi,
>
>
> I quickly changed the code so that the graph structure no longer contains
> the list of nodes, and the same behaviour still persists. For the actual
> implementation I have changed it to a function that returns a list of
> nodes,
I believe I understand one problem in the original tabling implementation.
I will try to get a patch in this weekend. There may be another trickier
issue but let's see how much the fix I have in mind will help first.
On Monday, October 1, 2012, Reinout Stevens wrote:
>
>
> On Saturday, September
On Thu, Oct 4, 2012 at 8:46 PM, David Nolen wrote:
> On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens wrote:
>
>> Hi,
>>
>>
>> I quickly changed the code so that the graph structure no longer contains
>> the list of nodes, and the same behaviour still persists. For the actual
>> implementation I h
On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens wrote:
> Hi,
>
>
> I quickly changed the code so that the graph structure no longer contains
> the list of nodes, and the same behaviour still persists. For the actual
> implementation I have changed it to a function that returns a list of
> nodes,
Looking into it.
On Monday, October 1, 2012, Reinout Stevens wrote:
>
>
> On Saturday, September 29, 2012 11:10:38 PM UTC+2, David Nolen wrote:
>>
>> On Wed, Sep 26, 2012 at 9:20 AM, Reinout Stevens wrote:
>>
>>> Hi,
>>>
>>>
>>> I'm the author of a DSL that allows reasoning over paths throughout
On Saturday, September 29, 2012 11:10:38 PM UTC+2, David Nolen wrote:
>
> On Wed, Sep 26, 2012 at 9:20 AM, Reinout Stevens
>
> > wrote:
>
>> Hi,
>>
>>
>> I'm the author of a DSL that allows reasoning over paths throughout
>> graphs using core.logic ( https://github.com/ReinoutStevens/damp.qwal
On Wed, Sep 26, 2012 at 9:20 AM, Reinout Stevens wrote:
> Hi,
>
>
> I'm the author of a DSL that allows reasoning over paths throughout graphs
> using core.logic ( https://github.com/ReinoutStevens/damp.qwal ). We
> noticed that for larger graphs performance became horribly slow, even
> though th
Op woensdag 26 september 2012 22:21:26 UTC+2 schreef David Nolen het
volgende:
>
> On Wed, Sep 26, 2012 at 8:20 AM, Reinout Stevens
>
> > wrote:
>
>> Hi,
>>
>>
>> I'm the author of a DSL that allows reasoning over paths throughout
>> graphs using core.logic ( https://github.com/ReinoutStevens
On Wed, Sep 26, 2012 at 8:20 AM, Reinout Stevens wrote:
> Hi,
>
>
> I'm the author of a DSL that allows reasoning over paths throughout graphs
> using core.logic ( https://github.com/ReinoutStevens/damp.qwal ). We
> noticed that for larger graphs performance became horribly slow, even
> though th
Hi,
I'm the author of a DSL that allows reasoning over paths throughout graphs
using core.logic ( https://github.com/ReinoutStevens/damp.qwal ). We
noticed that for larger graphs performance became horribly slow, even
though there is no apparent reason why it should be. First investigations
l
16 matches
Mail list logo
