will have a web meeting celebrating the new
>> Datahike releats: https://lambdaforge.io/2019/09/20/dat
>> ahike-release-0.2.0.html… <https://t.co/9OmaHy8iqw?amp=1> Agenda: •
>> @konradkuehne <https://twitter.com/konradkuehne>
>> about the new Datahike, and Da
g the new
> Datahike releats: https://lambdaforge.io/2019/09/20/dat
> ahike-release-0.2.0.html… <https://t.co/9OmaHy8iqw?amp=1> Agenda: •
> @konradkuehne <https://twitter.com/konradkuehne>
> about the new Datahike, and Datalog in general. • Discussion of community
> challeng
itter.com/konradkuehne>
about the new Datahike, and Datalog in general. • Discussion of community
challenges.
--
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
Alex Warth from HARC (Human Advancement Research Center) wrote a natural
language datalog engine.
It's is used to represent facts and queries in Bret
Victor's https://dynamicland.org/
Could it work with Datomic?
Demo: http://alexwarth.com/projects/nl-datalog/
Repo: https://github.com/harc
#expressions
Hth!
On 1 September 2017 at 14:50, Dustin Getz <dustin.g...@gmail.com> wrote:
> Datomic allows clojure.core fns to be embedded inside datalog queries,
> except eval (http://docs.datomic.com/query.html)
>
> 1. Do we know how secure is this - what if the datalog comes from untr
Datomic allows clojure.core fns to be embedded inside datalog queries,
except eval (http://docs.datomic.com/query.html)
1. Do we know how secure is this - what if the datalog comes from untrusted
user input?
2. What is the best way to implement restricted-eval like this on jvm,
compared
tx: x1}
With indexes on e, a, v, and tx
I think I understand how to do most queries against that manually, but what
I want to explore is if there is some way to translate a datalog query into
the required Firebase queries... and whether I can answer all the kinds of
questions I want to ask
Hi!
I’m glad to announce my new library, DataScript.
It’s an open-source, from-the-scratch implementation of in-memory immutable
database aimed at ClojureScript with API and data model designed after
Datomic. Full-featured Datalog queries included.
Library is here: https://github.com
Prokopov wrote:
Hi!
I’m glad to announce my new library, DataScript.
It’s an open-source, from-the-scratch implementation of in-memory
immutable database aimed at ClojureScript with API and data model designed
after Datomic. Full-featured Datalog queries included.
Library is here
Hi Daniel,
First sentence was written from Datomic standpoint. In Datomic, all history is
kept in the database ref. Given ref to an immutable DB, you can rewind back to
any point in time. I can guess that each DB value consist of indexes to
current, latest state + append-only history log.
), but at some point in past I extracted it from sources of
clojure-contrib and put it on github (with few updates to code, nothing
major):
https://github.com/piranha/datalog
On Sun, Dec 9, 2012 at 1:15 PM, Shantanu Kumar
kumar.s...@gmail.comjavascript:
wrote:
Hi,
I saw clojure
to code, nothing
major):
https://github.com/piranha/datalog
On Sun, Dec 9, 2012 at 1:15 PM, Shantanu Kumar
kumar.shant...@gmail.comwrote:
Hi,
I saw clojure-contrib datalog has not made it into modular contribs:
https://github.com/clojure/clojure-contrib/tree/master/modules/datalog
http
Hi,
I saw clojure-contrib datalog has not made it into modular contribs:
https://github.com/clojure/clojure-contrib/tree/master/modules/datalog
http://dev.clojure.org/display/design/Where+Did+Clojure.Contrib+Go
http://dev.clojure.org/display/doc/Clojure+Contrib+Libraries
Does anybody know
I've seen hinted (and I'm pretty sure I've seen examples, but I can't
remember where) that Datomic can incorporate data from regular Clojure
collections. Is there some doc for this or an example?
Thanks in advance
Hi Mark,
I have moved this to the Datomic group and answered it there:
I've seen hinted (and I'm pretty sure I've seen examples, but I can't
remember where) that Datomic can incorporate data from regular Clojure
collections. Is there some doc for this or an example?
Thanks in advance
--
You received this message because you are subscribed to the Google
Groups
I am new to clojure but learning quickly. I haven't yet tried
clojure.contrib.Datalog, but I analyze big data and I can say that I
quite like Nathan Marz's Cascalog. Cascalog is reminiscent of datalog
syntax but executes queries on Hadoop via Cascading for data that is
too big to fit in memory
Has anyone used clojure.contrib.Datalog for anything serious? What
kind of problem
did you run into if any?
What is the performance like? Is there a sweet spot beyond that it's completely
in memory only?
Thanks,
--
Omnem crede diem tibi diluxisse supremum.
--
You received this message
where I need to define my own predicates.
These can be quite ad-hoc. eg. a part number is be part of a certain
family of devices. But two part numbers from the same device family
might use different microcontrollers, etc. So datalog sounded very
interesting to me.
Sincerely
Meikel
--
You received
On Mon, Sep 14, 2009 at 10:02 PM, Tom Faulhaber tomfaulha...@gmail.com wrote:
Did you also read the overview that's part of contrib at
http://richhickey.github.com/clojure-contrib/doc/datalog.html.
So because of this thread, I just went and perused the description of
the Clojure datalog
Much of the semantics of the query language is based on Prolog.
as an aside, i was under the impression that Datalog was syntactically
a subset of Prolog, but was not semantically so much so, since in
Prolog order matters e.g. wrt termination.
sincerely
for your answer.
I have read the sources of datalog, however, literal.clj and the ideas
of the query language behind it is unknown for me, thus I can not
understand it quite well. The same thing happens when I saw magic.clj,
in which file I saw magic transformation.
I ran the example you posted
I am trying to use datalog now, have the following questions:
1. How about the memory consumption of datalog?
2. There are examples of datalog, but can I find more detailed
document about the query language?
--~--~-~--~~~---~--~~
You received this message because
Two more questions:
3. In datalog.database , it is required that every tuple must has
exactly same field as in database define, is that possible to just
define some necessary fields, and tuples appended can have additional
optional fields?
4. What is a magic transformation? I googled the term,
the information is stored using standard clojure
datastructures. Profiling datalog programs is no different than
profiling clojure programs. I haven't seen it to be a problem, but
I'm not using it in performance critical applications.
The best document about the query language is the example code
Thank you Josh for your answer.
I have read the sources of datalog, however, literal.clj and the ideas
of the query language behind it is unknown for me, thus I can not
understand it quite well. The same thing happens when I saw magic.clj,
in which file I saw magic transformation.
I ran
On Sep 12, 9:53 pm, Robert Luo robort...@gmail.com wrote:
Thank you Josh for your answer.
Thank you for being interested in the datalog library. :)
I have read the sources of datalog, however, literal.clj and the ideas
of the query language behind it is unknown for me, thus I can
I've added some Datalog material to the wiki:
http://code.google.com/p/clojure-contrib/wiki/DatalogOverview
On Wed, Feb 18, 2009 at 4:55 PM, Jeffrey Straszheim
straszheimjeff...@gmail.com wrote:
Makes sense. That would work. It certainly looks cleaner.
On Wed, Feb 18, 2009 at 4:51 PM
Could this be of any help for your development? There is now a version
of Datalog for PLT Scheme:
Software:
http://planet.plt-scheme.org/display.ss?package=datalog.pltowner=jaymccarthy
Documentation:
http://planet.plt-scheme.org/package-source/jaymccarthy/datalog.plt/1/0/planet-docs/datalog
It is worth looking at.
On Wed, Feb 18, 2009 at 12:42 PM, Telman Yusupov use...@yusupov.com wrote:
Could this be of any help for your development? There is now a version
of Datalog for PLT Scheme:
Software:
http://planet.plt-scheme.org/display.ss?package=datalog.pltowner=jaymccarthy
I see nothing in his code or documentation for handling negation or
stratification. Also, it appears to be a top down evaluator, and I don't
see any fixed-point or other recursion handling. I *suspect* this does not
guarantee termination over arbitrary safe rules. It is not real Datalog
. But now, as long as your queries are non-negated it is
working.
http://code.google.com/p/clojure-datalog/
I got a chance to look at your docs:
http://code.google.com/p/clojure-datalog/wiki/BasicSyntax
I think your choice of using maps (we don't call them hashes in
Clojure as they might
it is
working.
http://code.google.com/p/clojure-datalog/
I got a chance to look at your docs:
http://code.google.com/p/clojure-datalog/wiki/BasicSyntax
I think your choice of using maps (we don't call them hashes in
Clojure as they might not be hash tables) is right on the money
it is
working.
http://code.google.com/p/clojure-datalog/
I got a chance to look at your docs:
http://code.google.com/p/clojure-datalog/wiki/BasicSyntax
I think your choice of using maps (we don't call them hashes in
Clojure as they might not be hash tables) is right on the money
queries are
non-negated
it is
working.
http://code.google.com/p/clojure-datalog/
I got a chance to look at your docs:
http://code.google.com/p/clojure-datalog/wiki/BasicSyntax
I think your choice of using maps (we don't call them hashes in
Clojure as they might
, and then some version of
magic
sets
optimization. But now, as long as your queries are
non-negated
it is
working.
http://code.google.com/p/clojure-datalog/
I got a chance to look at your docs:
http://code.google.com/p/clojure-datalog/wiki/BasicSyntax
I
optimization. But now, as long as your queries are
non-negated
it is
working.
http://code.google.com/p/clojure-datalog/
I got a chance to look at your docs:
http://code.google.com/p/clojure-datalog/wiki/BasicSyntax
I think your choice of using
, and then some version of magic sets
optimization. But now, as long as your queries are non-negated it is
working.
http://code.google.com/p/clojure-datalog/
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Clojure group
://code.google.com/p/clojure-datalog/
--~--~-~--~~~---~--~~
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
To unsubscribe from this group, send email to
clojure+unsubscr
:
There is no reason to have just one option.
On Thu, Feb 5, 2009 at 3:59 PM, Rich Hickey richhic...@gmail.com wrote:
Thanks for the pointer to Kodkod - it looks very interesting.
I wonder if we aren't talking apples and oranges though. Datalog may
be a basic reasoner, but it's a simple recursive query
have recursive queries working. My next 3 milestones are stratified
negation, evaluable predicates, and then some version of magic sets
optimization. But now, as long as your queries are non-negated it is
working.
http://code.google.com/p/clojure-datalog
at 3:59 PM, Rich Hickey richhic...@gmail.com wrote:
Thanks for the pointer to Kodkod - it looks very interesting.
I wonder if we aren't talking apples and oranges though. Datalog may
be a basic reasoner, but it's a simple recursive query language for
data. Can you even get all results out
On Feb 4, 5:22 pm, John Fries john.a.fr...@gmail.com wrote:
Guaranteed-termination is very desirable. However, you can have guaranteed
termination with an open-world assumption just as well. And I think an
open-world assumption does a better job of mimicking human reasoning.
Do you have a
Yes. I can make a strong endorsement for Kodkod, a Java-based relational
model finder.
http://alloy.mit.edu/kodkod/
I used it fairly extensively last year to solve scheduling problems, and
I've corresponded with its creator.
One problem with Datalog-style reasoners is that, because they want
Thanks for the pointer to Kodkod - it looks very interesting.
I wonder if we aren't talking apples and oranges though. Datalog may
be a basic reasoner, but it's a simple recursive query language for
data. Can you even get all results out of a SAT solver or do they stop
when satisfiable?
It's
There is no reason to have just one option.
On Thu, Feb 5, 2009 at 3:59 PM, Rich Hickey richhic...@gmail.com wrote:
Thanks for the pointer to Kodkod - it looks very interesting.
I wonder if we aren't talking apples and oranges though. Datalog may
be a basic reasoner, but it's a simple
providing relations from clojure-sets and sql-queries.
Wow - this is really neat Erik - thanks for showing
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Clojure group.
To post to this group, send email to
AFAICT, Datalog only supports the closed-world assumption. Does
anyone prefer an open-world assumption reasoner? In my opinion, they
are significantly more powerful.
On Feb 4, 6:16 am, Timothy Pratley timothyprat...@gmail.com wrote:
providing relations from clojure-sets and sql-queries
Well, Datalog does give you guaranteed termination, so there is that,
although its bottom-up strategy is A LOT harder to implement (I'm now
trolling trough about a billion journal articles on magic sets and
so on to try to fix this).
I expect to provide full-on evaluable predicates, which I
wrote:
Well, Datalog does give you guaranteed termination, so there is that,
although its bottom-up strategy is A LOT harder to implement (I'm now
trolling trough about a billion journal articles on magic sets and
so on to try to fix this).
I expect to provide full-on evaluable predicates
for writing datalog programs and
providing relations from clojure-sets and sql-queries. Unfortunately
the whole package is currently broken while I'm completing the
surrounding relational algebra library.
But maybe someone wants to look at the code:
http://github.com/hoeck/ra/blob
I'd call it a night :)
Did the same thing some time ago. Iris has good (at least good enough)
API docs in pdf and javadoc form. Inspired by the Allegro CL Prolog
syntax i set up a little DSL for writing datalog programs and
providing relations from clojure-sets and sql-queries. Unfortunately
(www.iris-
reasoner.org) mentioned above.
One thing i added is the possiblity to add clojure-sets as named
relations to a iris datalog program.
All the evaluation is done by iris. The wrapper is part of a larger
library dealing with lazy relational operators and sets.
erik
) mentioned above.
One thing i added is the possiblity to add clojure-sets as named
relations to a iris datalog program.
All the evaluation is done by iris. The wrapper is part of a larger
library dealing with lazy relational operators and sets.
erik
. Then I got somewhat lost and figured I'd call it a night :)
I couldn't find much info (any?) at all on the web about Datalog or
how to use IRIS in general... it certainly seems interesting as a
solver, but in practical terms how can I take advantage of it? Ok I
can think of some classic solver
It would have been nice if that link was prominent on their website.
They still haven't responded to the email I sent them.
On Feb 2, 10:13 am, Timothy Pratley timothyprat...@gmail.com wrote:
Just thought I'd share this
link:http://www.murat-knecht.de/schuerfen/irisdoc/html-single/index.html
Just thought I'd share this link:
http://www.murat-knecht.de/schuerfen/irisdoc/html-single/index.html
Particularly Examples 1.2 and 1.6 show how the parts fit together.
I really wish I saw that before attempting anything :) Well now I know
for next time.
Datalog is a cool problem.
I've started writing some code. The rule-unification part of the
algorithm is trivial -- its not even proper unification at all. The
hard part seems to be optimising the query strategy to avoid
materialising too much. The advantage is you can support rules
learning Clojure. I
saw it mentioned online that several members of the existing community
were looking for someone to build a datalog for Clojure: I was
wondering what exactly you had in mind?
Were you thinking of a faithful implementation of the original Datalog
rule/query language?
Yes
I've been doing some more research on this. This article seems a good
introduction:
http://www.dcc.uchile.cl/~cgutierr/cursos/FDB/p16-bancilhon.pdf
It turns out the naive implementation (a bottom-up fixed point
iterator) is pretty easy to understand, and would not be hard to
implement --
Doing something like Datalog would be terrific fun. I might
contribute if there is interest.
I'm not an academic, so most of my contributions would be on a
practical level. We'd need someone else to provide the deeper aspects
of theory.
I've read Norvig's book, and understand his code, and my
On Jan 26, 11:44 pm, smanek sma...@gmail.com wrote:
Hello all,
I'm a Common Lisp programmer who has just started learning Clojure. I
saw it mentioned online that several members of the existing community
were looking for someone to build a datalog for Clojure: I was
wondering what exactly
Hello all,
I'm a Common Lisp programmer who has just started learning Clojure. I
saw it mentioned online that several members of the existing community
were looking for someone to build a datalog for Clojure: I was
wondering what exactly you had in mind?
Were you thinking of a faithful
Hello all,
I'm a Common Lisp programmer who has just started learning Clojure. I
saw it mentioned online that several members of the existing community
were looking for someone to build a datalog for Clojure: I was
wondering what exactly you had in mind?
Were you thinking of a faithful
learning Clojure. I
saw it mentioned online that several members of the existing community
were looking for someone to build a datalog for Clojure: I was
wondering what exactly you had in mind?
Were you thinking of a faithful implementation of the original Datalog
rule/query language
64 matches
Mail list logo
