|
|
Up |
|
|
  |
Author: A.L.A.L.
Date: Sep 16, 2008 13:17
There is perception within the industry that "if you know C++ then you
will learn any other language within 2 weeks"
What is true if "other language" is Java. And is true if "knowledge of
other language" is pretty shallow.
Now some guys want to apply the same principle to Prolog. There is
20 K lines of Prolog (with CLP) and they want someone to "learn
Prolog fast" to maintain this code, and they expect that this
"someone" will learn Prolog and CLP within 2 weeks.
Of course this is not possible.
However, there is the question: How long it would take for average
graduate of average (or below average) college plus 2 years experience
and being far from being Einstein, as well as with no clue about
logic, logic programming and mathematics to learn and master Prolog
and CLP to the level tat this person would be able to perform the task
mentioned above?
I have no experience with teaching Prolog; maybe somebody with such
experience have an idea?...
A.L.
|
| |
|
| |
11 Comments |
|
  |
Author: A.L.A.L.
Date: Sep 16, 2008 12:24
There is perception within the industry that "if you know C++ then you
will learn any other language within 2 weeks"
What is true if "other language" is Java. And is true if "knowledge of
other language" is pretty shallow.
Now some guys want to apply the same principle to Prolog. There is
20 K lines of Prolog (with CLP) and they want someone to "learn
Prolog fast" to maintain this code, and they expect that this
"someone" will learn Prolog and CLP within 2 weeks.
Of course this is not possible.
However, there is the question: How long it would take for average
graduate of average (or below average) college plus 2 years experience
and being far from being Einstein, as well as with no clue about
logic, logic programming and mathematics to learn and master Prolog
and CLP to the level tat this person would be able to perform the task
mentioned above?
I have no experience with teaching Prolog; maybe somebody with such
experience have an idea?...
A.L.
|
| |
|
| |
4 Comments |
|
  |
Author: Markus TriskaMarkus Triska
Date: Sep 16, 2008 11:27
Frequently Asked Questions - comp.lang.prolog
Last-modified: 2008-02-15
Last-changes: Add Planet Prolog
Markus Triska (Mar. 2 2007 - ... )
Remko Troncon (Jan. 6 2002 - Mar. 2 2007)
Dirk-Jan Faber (Feb. 1 1999 - Jan. 6 2002)
Jamie Andrews (Aug 26 1992 - Oct. 16 1997)
__________________________________________________________________
General Information: This article contains the answers to some
Frequently Asked Questions (FAQ) often seen in
news://comp.lang.prolog/. It is posted (twice a month, currently on
the 2nd and 16th) to help reduce volume in this newsgroup and to
provide hard-to-find information of general interest.
The World Wide Web URL for this FAQ is:
http://www.logic.at/prolog/faq/
Questions about the FAQ and updates ought to be submitted to
.
1. What is the Association for Logic Programming?
2. Where can I get a free Prolog for system X (PC, Mac, Unix or other)?
|
| Show full article (28.94Kb) |
|
no comments
|
|
  |
Author: Warren HenningWarren Henning
Date: Sep 12, 2008 21:47
Suppose I have two terms as follows.
table(col1, col2).
table(col1, col2, col3).
I can list these by typing listing(table). I can search for instances
with a given fixed arity by querying for table(X, Y) or table(X, Y,
Z).
But suppose I want to programatically retrieve both definitions (and
any others with any number of "colN"s) and then decompose them using
the =.. operator. How would I do that?
Thanks.
Warren Henning
|
| |
|
2 Comments |
|
  |
Author: RCRA 2008RCRA 2008
Date: Sep 12, 2008 03:04
[Apologies for cross-posting]
Due to the many requests, the organizing committee of RCRA 2008 gives
the following extensions:
* Deadline extension: *** 30 September 2008 ***
* Pages extension: 15 pages in standard article format (11pt)
Please note that there is no deadline extension for the Special Issue
of the Journal of Algorithms in Logic, Informatics and Cognition
(Elsevier).
* ________________________________________________________________ *
The RCRA group (Knowledge Representation & Automated Reasoning) of the
AI*IA (Italian Association for Artificial Intelligence)
http://www.dis.uniroma1.it/~rcra
organises the
15th RCRA international workshop:
Experimental evaluation of algorithms for solving problems
with combinatorial explosion
http://www.dis.uniroma1.it/~rcra08
rcra08@dis.uniroma1.it
* ________________________________________________________________ *
|
| Show full article (8.38Kb) |
|
no comments
|
|
  |
|
|
  |
Author: Chip EasthamChip Eastham
Date: Sep 8, 2008 11:33
On Sep 8, 10:50 am, michael.ig...@web.de (Michael Igler) wrote:
> Hello,
>
> I have the following clause that is doing a state transition:
>
> do(State, X, NewState) :- executable(State, X),
> update_state(State, X,
> NewState).
>
> In a Prolog Session
>
> ?- do([a:0, b:0, c:0, d:0], X, NS).
> X = a,
> NS = [a:1, b:0, c:0, d:0] ;
> X = b,
> NS = [a:0, b:1, c:0, d:0] ;
> X = c,
> NS = [a:0, b:0, c:1, d:0] ;
>
> will give me the label for the edge (X) and the name of the new ...
|
| Show full article (0.97Kb) |
|
no comments
|
|
  |
Author: Michael IglerMichael Igler
Date: Sep 8, 2008 07:50
Hello,
I have the following clause that is doing a state transition:
do(State, X, NewState) :- executable(State, X),
update_state(State, X,
NewState).
In a Prolog Session
?- do([a:0, b:0, c:0, d:0], X, NS).
X = a,
NS = [a:1, b:0, c:0, d:0] ;
X = b,
NS = [a:0, b:1, c:0, d:0] ;
X = c,
NS = [a:0, b:0, c:1, d:0] ;
will give me the label for the edge (X) and the name of the new
node (NS).
Is it possible to generate a graph (maybe with library ugraph for later
search) with all the states that can be reached?
Mike
|
| |
|
no comments
|
|
  |
Author: Markus TriskaMarkus Triska
Date: Sep 2, 2008 13:54
Frequently Asked Questions - comp.lang.prolog
Last-modified: 2008-02-15
Last-changes: Add Planet Prolog
Markus Triska (Mar. 2 2007 - ... )
Remko Troncon (Jan. 6 2002 - Mar. 2 2007)
Dirk-Jan Faber (Feb. 1 1999 - Jan. 6 2002)
Jamie Andrews (Aug 26 1992 - Oct. 16 1997)
__________________________________________________________________
General Information: This article contains the answers to some
Frequently Asked Questions (FAQ) often seen in
news://comp.lang.prolog/. It is posted (twice a month, currently on
the 2nd and 16th) to help reduce volume in this newsgroup and to
provide hard-to-find information of general interest.
The World Wide Web URL for this FAQ is:
http://www.logic.at/prolog/faq/
Questions about the FAQ and updates ought to be submitted to
.
1. What is the Association for Logic Programming?
2. Where can I get a free Prolog for system X (PC, Mac, Unix or other)?
|
| Show full article (28.94Kb) |
|
no comments
|
|
  |
|
|
  |
Author: logicmoologicmoo
Date: Sep 1, 2008 12:28
I am asking here because all the implementers seem to read this board :)
I am adding Paul Tarau's Fluents from Kernel Prolog to PrologCafe, but then
discovered jprolog and might add them to JProlog instead.
They seem basically the same system (jProlog and PrologCafe) except a few
renames to more "java naming conventions" and PrologCafe just implements a
very nice IO library that jprolog had on the @todo list.
But PrologCafe has a more complex way of implementing the prolog database (I
haven't seen a performance gain).
And have had a hard time interfacing to it from 3rd party (mine) prolog
database.
So here is the questions I have:
Should I (be able to seamlessly) replace the PrologCafe database system
with jprolog's?
Should I (be able to seamlessly) compile the PrologCafe IO subsystem system
with jprolog?
The attributed variables work pretty well in jprolog to the modern
expectations of attributed variables?
The attributed variables of jprolog got broken during the creation of
PrologCafe from jprolog?
|
| |
|
6 Comments |
|
|
|
|
|
|