t;
>>> We can derive the synonymous relationship indirectly: if big is a
>>> synonym for large and large is a synonym for huge then big is a synonym for
>>> huge.
>>> Being synonyms doesn’t depend on order, e.g. if big is a synonym for
>>> large then large is
.core.logic.
>>
>> a. How to state the input pairs of synonyms as logical
>> statements/constraints?
>> b. How to perform a query to find all synonyms of a given word?
>>
>> Or perhaps I am yack shaving? What would be a simpler way to solve this?
>>
>> This
g large]
>> [large huge]
>> [small little]
>>
>> We can derive the synonymous relationship indirectly: if big is a synonym
>> for large and large is a synonym for huge then big is a synonym for huge.
>> Being synonyms doesn’t depend on order, e.g. if big is a s
huge]
> [small little]
>
> We can derive the synonymous relationship indirectly: if big is a synonym
> for large and large is a synonym for huge then big is a synonym for huge.
> Being synonyms doesn’t depend on order, e.g. if big is a synonym for large
> then large is a synonym
big is a synonym for huge.
Being synonyms doesn’t depend on order, e.g. if big is a synonym for large
then large is a synonym for big.
The program has to answer whether given two words are synonyms or not.
This seems to me as a good candidate for logic programming, e.g. with
clojure.core.logic
the reason I want to take
a
> try of Clojure logic programming is the simplicity:
>
> * setup for core.logic is very easy by lein
> * no server needed
> * and even from the concept level, Semantic Web is based on Description
> logic which is purely logic things.
>
> Maybe th
Thanks very much, David, Timothy and Karsten,
I know some RDF store like Jena or Stardog, but the reason I want to take a
try of Clojure logic programming is the simplicity:
* setup for core.logic is very easy by lein
* no server needed
* and even from the concept level, Semantic Web is based on
t;> David
>>
>>
>> On Mon, Aug 5, 2013 at 12:41 PM, Mingli Yuan wrote:
>>
>>> Hi, folks,
>>>
>>> After one night quick work, I had gave a proof-of-concept to demonstrate
>>> the feasibility that we can combine Wikidata and Clojure logic progra
roof-of-concept to demonstrate
>> the feasibility that we can combine Wikidata and Clojure logic programming
>> together.
>>
>> The source code is at here:
>> https://github.com/mountain/knowledge
>>
>> An example of an entity:
>>
>> https://github
thing with different goals.
David
On Mon, Aug 5, 2013 at 12:41 PM, Mingli Yuan wrote:
> Hi, folks,
>
> After one night quick work, I had gave a proof-of-concept to demonstrate
> the feasibility that we can combine Wikidata and Clojure logic programming
> together.
>
> The
Hi, folks,
After one night quick work, I had gave a proof-of-concept to demonstrate
the feasibility that we can combine Wikidata and Clojure logic programming
together.
The source code is at here:
https://github.com/mountain/knowledge
An example of an entity:
https://github.com/mountain
Thanks David!
--
--
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, s
looking for David Nolen's old blog at posterous where he had posted
> a reading list for logic programming, but that blog is no longer available.
> Does anyone have that list? Or, David, if you could repost it on your new
> blog, I'm sure others would appreciate
I was looking for David Nolen's old blog at posterous where he had posted a
reading list for logic programming, but that blog is no longer available. Does
anyone have that list? Or, David, if you could repost it on your new blog, I'm
sure others would appreciate it too!
Che
It's a bit difficult what I'm trying to do, but I'll try my best to explain
it. I'd like to take an arbitrary predicate, and find which facts could be
entered in the database that could make it true.
I'm working on a computer game dialogue framework that allows communication
between agents (i.
Wow, thanks for the great information everyone.
David – I don't know how we'll make it pluggable, I was thinking users
could provide functions that return a set of constraints. And there
would probably be a cost function that users could override as well.
On Oct 24, 3:26 pm, Jamie Brandon
wrote:
Ok, clearly I've not been keeping up, sorry :)
On 24 October 2012 18:17, David Nolen wrote:
> On Wed, Oct 24, 2012 at 6:07 PM, Jamie Brandon
> wrote:
>>
>> It sounds like something that would benefit from good constraint
>> propagation. If I remember correctly, core.logic only support
>> propaga
On Wed, Oct 24, 2012 at 6:07 PM, Jamie Brandon wrote:
> It sounds like something that would benefit from good constraint
> propagation. If I remember correctly, core.logic only support
> propagating equality/inequality constraints which can be pretty slow
> for exploring large domains. Something
It sounds like something that would benefit from good constraint
propagation. If I remember correctly, core.logic only support
propagating equality/inequality constraints which can be pretty slow
for exploring large domains. Something like gecode
(http://www.gecode.org) might be a better fit if you
might be a better fit.
>
I'm not sure if this is true if you want non-expert users to easily
customize it. Constraint Logic Programming tends to allow descriptions
closer to the domain -
I may be offbase here but I found this comparison of the techniques highly
illuminating -
&qu
Nathan:
I don't know core.logic's capabilities, and I haven't looked at the kinds of
constraints you describe in enough detail to say for sure, but my initial
reaction is that linear/integer programming might be a better fit.
It has been about 5-10 years, but in the past I've had success with r
On Wed, Oct 24, 2012 at 5:17 PM, nathanmarz wrote:
> Cool, thanks for the quick response. We'll be looking into this pretty
> soon. I ultimately want the logic engine itself being exposed to users
> so they can add their own company-specific constraints to resource
> scheduling – which will be to
On 10/24/12 2:56 PM, nathanmarz wrote:
I'm looking into rewriting Storm's resource scheduler using
core.logic. I want to be able to say constraints like:
1. Topology A's slots should be <= 10 and as close to 10 as possible
(minimize the delta between assigned slots and 10)
2. All topologies shou
Cool, thanks for the quick response. We'll be looking into this pretty
soon. I ultimately want the logic engine itself being exposed to users
so they can add their own company-specific constraints to resource
scheduling – which will be totally badass. If you're interested in
tracking this, I opened
On Wed, Oct 24, 2012 at 4:56 PM, nathanmarz wrote:
> I'm looking into rewriting Storm's resource scheduler using
> core.logic. I want to be able to say constraints like:
>
> 1. Topology A's slots should be <= 10 and as close to 10 as possible
> (minimize the delta between assigned slots and 10)
>
I'm looking into rewriting Storm's resource scheduler using
core.logic. I want to be able to say constraints like:
1. Topology A's slots should be <= 10 and as close to 10 as possible
(minimize the delta between assigned slots and 10)
2. All topologies should use less than 200 CPU's and less than
miniKanren has been ported by David Nolen as well and is part of the core
set of Clojure libraries:
https://github.com/clojure/core.logic
On Sunday, August 19, 2012 5:42:15 PM UTC-4, David Nolen wrote:
>
> On Fri, Aug 17, 2012 at 11:45 PM, Benjamin Chi
> >
> wrote:
> > Hi Jim. Where is that l
On Fri, Aug 17, 2012 at 11:45 PM, Benjamin Chi wrote:
> Hi Jim. Where is that located? Thanks.
>
http://github.com/jduey/mini-kanren
--
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 t
Hi Jim. Where is that located? Thanks.
On Sunday, May 25, 2008 10:28:29 PM UTC-4, jim wrote:
>
> I just uploaded a file to the files area that implements a logic
> programming system from the book "The Reasoned Schemer" in Clojure.
>
> This book is a sequel to "
Jim Duey has been doing some very, very exciting work integrating
core.logic with JDK 7 fork/join:
http://www.clojure.net/2012/03/26/Messin-with-core.logic/
David
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to cl
On Sat, Dec 4, 2010 at 5:58 PM, jim wrote:
> Very, very nice. Excellent work. I look forward to using it.
>
> I was looking at porting Kanren proper to Clojure. There appear to be
> some really good ideas in there that maybe could be added to Logos.
>
> Very well done.
>
> Jim
I agree that ther
of Clojure.
> >
> > Future directions:
> > * Friendlier interface for defining facts and running queries
> > * There are many great ideas in William Byrd's thesis that need looking
> > into. In particular I'm interested in tabling.
> > * Investigating re
d's thesis that need looking
> into. In particular I'm interested in tabling.
> * Investigating replacing the PersistentHashMap with a Skew Binary Random
> Access List or a Finger Tree. This would speed up the performance of the
> most expensive functions in the system, walk.
ap with a Skew Binary Random
> Access List or a Finger Tree. This would speed up the performance of the
> most expensive functions in the system, walk. In the Scheme implementations
> SBRALs can lead to 2.5X-100X in performance.
> * Modifying the core macros to optimize logic programs.
terested in tabling.
* Investigating replacing the PersistentHashMap with a Skew Binary Random
Access List or a Finger Tree. This would speed up the performance of the
most expensive functions in the system, walk. In the Scheme implementations
SBRALs can lead to 2.5X-100X in performance.
* Modifyi
No. That's one of the improvements I would make if I get back to
working on it again.
Jim
On Mar 26, 1:37 pm, Sophie wrote:
>
> Is it aware of all Clojure structures, including maps etc?
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to th
Really nice!
Is it aware of all Clojure structures, including maps etc?
--
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 w
As well as optimizing compilers, there are many knowledge bases
available for prolog. Most people with a practical application that
needs an expert system are probably far more invested in that
knowledge base (the prolog code is a 'knowledge base') than in
anything else.
--
You received this mess
I've got to say that I'm not a logic programming guru. Mostly I just
see the promise there. The observation about graph search came from
the book "Simply Logical" that I linked to at the end, I believe. I
certainly didn't originate it.
If you check out Oleg's pag
at different people have different ideas of what makes a language useful.
Practically speaking, the main advantage of Prolog is probably that optimizing
compilers have been developed for quite some time. Logic programming systems in
Lisp (and other languages) will probably never catch up wit
Very interesting write up.
What advantages would prolog have over such a language. Or if we are
trying to move beyond language wars - what styles of logic programming
would be more natural in either one or the other?
I say that because my first thought is if you could build a logic
language on
I just posted a new tutorial about doing logic programming in Clojure.
It makes use of the mini-Kanren port to Clojure I did last year. It's
intended to reduce the learning curve when reading "The Reasoned
Schemer", which is an excellent book.
http://intensivesystems.net/tutorials/
On Jun 17, 2009, at 7:39 AM, Sean Devlin wrote:
>
> Sounds awesome! Will you be able to post any material after the
> talk? You know, slides, videos, notes, etc?
Sure thing. I'll post my slides and whatever code I wind up writing. I
don't think anyone will be taping it though (which is pro
> Sounds awesome! Will you be able to post any material after the
> talk? You know, slides, videos, notes, etc?
Seconded -- I haven't *yet* done anything cool with Clojure and
Datalog... but I would like to :)
--~--~-~--~~~---~--~~
You received this message be
Sounds awesome! Will you be able to post any material after the
talk? You know, slides, videos, notes, etc?
Sean
On Jun 17, 5:35 am, Daniel Lyons wrote:
> Hi everyone,
>
> I'm doing a short talk on declarative/logic programming, reasoning and
> expert systems for the
Hi everyone,
I'm doing a short talk on declarative/logic programming, reasoning and
expert systems for the Albuquerque Lisp/Scheme group this Sunday. I
have to talk about Prolog and CLIPS but since the future is here I
hope to give some time to Clojure.
If you've done something
On Feb 24, 3:28 pm, Chouser wrote:
> On Tue, Feb 24, 2009 at 1:18 PM, Michel S. wrote:
>
> > Kanren / Mini Kanren (Mini is the version in Reasoned Schemer) are MIT-
> > licensed:
>
> >http://kanren.sourceforge.net/#Availability
>
> > so even a port is alright.
>
> The problem is that to be inc
On Tue, Feb 24, 2009 at 1:18 PM, Michel S. wrote:
>
> Kanren / Mini Kanren (Mini is the version in Reasoned Schemer) are MIT-
> licensed:
>
> http://kanren.sourceforge.net/#Availability
>
> so even a port is alright.
The problem is that to be included in contrib, it needs to be the
original work
Good to know. Thanks.
Michel S. wrote:
> On Feb 24, 11:03 am, Rich Hickey wrote:
> Kanren / Mini Kanren (Mini is the version in Reasoned Schemer) are MIT-
> licensed:
>
> http://kanren.sourceforge.net/#Availability
>
> so even a port is alright. When I took Dan Friedman's class based on
> the b
On Feb 24, 11:03 am, Rich Hickey wrote:
> On Feb 24, 9:56 am, jim wrote:
>
> > One stepping stone to getting my parenscript-like javascript generator
> > released is to get the logic programming module released. A couple of
> > months ago, I implemented the system fr
Hadn't thought of that. There are two parts, the unification part and
the implementation of the operators. In the interest of time and
learning, I originally did a port of both parts. What I've since done
is re-implement the operators, so that's a totally original
implementation using lazy sequ
On Feb 24, 9:56 am, jim wrote:
> One stepping stone to getting my parenscript-like javascript generator
> released is to get the logic programming module released. A couple of
> months ago, I implemented the system from "The Reasoned Schemer" in
> Clojure and posted i
One stepping stone to getting my parenscript-like javascript generator
released is to get the logic programming module released. A couple of
months ago, I implemented the system from "The Reasoned Schemer" in
Clojure and posted it to the files section. I've updated it to take
a
53 matches
Mail list logo
