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
On 17 Oct 2012, at 19:31, David Nolen dnolen.li...@gmail.com wrote:
On Mon, Oct 8, 2012 at 10:00 AM, Reinout Stevens reste...@vub.ac.be 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
On Fri, Oct 19, 2012 at 11:47 AM, Coen De Roover cdero...@vub.ac.be 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
On Mon, Oct 8, 2012 at 10:00 AM, Reinout Stevens reste...@vub.ac.be 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 :)
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
rest...@vub.ac.bejavascript:
wrote:
Hi,
I quickly changed the code so that the graph structure no longer contains
the list of nodes, and the same behaviour still
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 rest...@vub.ac.be wrote:
Hi,
I quickly changed the code so that the graph structure no longer contains
the list of
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 Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens reste...@vub.ac.be 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
On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens reste...@vub.ac.be 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
On Thu, Oct 4, 2012 at 8:46 PM, David Nolen dnolen.li...@gmail.com wrote:
On Mon, Oct 1, 2012 at 9:13 AM, Reinout Stevens reste...@vub.ac.bewrote:
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
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
rest...@vub.ac.bejavascript:
wrote:
Hi,
I'm the author of a DSL that allows reasoning over paths throughout
graphs using core.logic (
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 rest...@vub.ac.bewrote:
Hi,
I'm the author of a DSL that allows reasoning over paths throughout
On Wed, Sep 26, 2012 at 9:20 AM, Reinout Stevens reste...@vub.ac.be 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,
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
On Wed, Sep 26, 2012 at 8:20 AM, Reinout Stevens reste...@vub.ac.be 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,
15 matches
Mail list logo