Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: SCI.LOGIC is a STAGNANT CESS PITT of LOSERS!
Replies: 7   Last Post: Nov 17, 2012 7:44 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Hercules ofZeus

Posts: 27
Registered: 9/19/11
Re: SCI.LOGIC is a STAGNANT CESS PITT of LOSERS!
Posted: Nov 17, 2012 6:37 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

> On Nov 18, 3:17 am, George Greene <gree...@email.unc.edu> wrote:
> > All YOU are doing is ADDING SOMETHING ON TOP of a system that IS
> > ALREADY MUCH BIGGER than "micro"!

>
> > You are not SHRINKING anything DOWN to "micro" by ADDING LONGER
> > versions of what IS ALREADY there!

>

No! This is where mathematics, logic, A.I. and computation separated
in 1972 when PROLOG came out.

the error??

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.


LISP! THEY TACKED LISP ONTO PROLOG!

In order to program

WHAT ARE THE MOONS OF SATURN?

moons( earth, moon ).
moons( mars, phoebos ).
moons( saturn, titan ).
moons( saturn, h20 ).
...


You have to CONVERT THAT RELATION TO A LIST!!!

list(moons,BAGOF(moons(saturn,X))))

It was IMMENSELY COMPLICATED and SQL came about with 1 line.

SELECT PLANET, MOON FROM TMOONS

.
.
.

there is just 1 algorithm with PROLOG

UNIFY ( f(a,B) , f(Z,g) ).

CAN YOU WORK OUT THE RESULTANT FUNCTION GEORGE?


...

Unfortunely UNIFY(F1,F2) is so powerful, you dont even NEED any
commands though they added 500 3GL commands to PROLOG.

Unfortuenatly UNIFY() is so powerful it doubles as a PROGRAMMING
LANGUAGE PARAMETER STACK AND FETCH CYCLE which is all people used it
for! Nothing 4GL was ever programmed in PROLOG!

microPROLOG is a SHELL OVER SQL.

SELECT ID, REF FROM TTAILS, TPRO
WHERE TTAILS.ID = TPRO.ID
AND TTAILS.REF = TPRO.REF
GROUP BY COUNT(ID)
ORDER BY ID DEDC

This is IMMENSELY FASTER, BINARY INDEXES BUILT IN, can handle 1
BILLION RECORDS on a standard Server.

This is a BREAKTHOUGH ITERATIVE UNIFY ALGORITHM

but you are all too self absorbed to understand how to use a data
structure of predicates.

A QUERY

?- vert ( pnt( 1,2 ) pnt( 1,4 ) )

This will be
ID REF FIELD TYP
=================
1 11 vert H
1 12 pnt P
1 13 pnt P
1 121 1 T
1 122 2 T
1 131 1 T
1 132 4 T


THE RULE INSTANTLY FOUND WITH SQL.

vert ( pnt( X,Y ) pnt( X,Z ) )

ID REF FIELD TYP
=================
21 11 vert H
21 12 pnt P
21 13 pnt P
21 121 X V
21 122 Y V
21 131 X V
21 132 Z V



Herc
--
www.microPROLOG.com




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.