The Math Forum

Search All of the Math Forum:

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

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

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Replies: 5   Last Post: Nov 20, 2012 4:40 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Jan Burse

Posts: 1,472
Registered: 4/12/05
Posted: Nov 20, 2012 10:46 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Graham Cooper schrieb:
> A lot of variable renaming conventions, trial and error,
> backtracking... very tricky and particular code covering
> dozens of potential matching scenerios!

Already efficiently solved to some extend in the 70's. Have
a read about the early childhood of Prolog systems:

La naissance de Prolog
Juillet 1992, A. Colmerauer, P. Roussel

> Slight drawback is program order is lost using the fastest match
> method, but PROLOG is overused as a simple FETCH cycle for 3GL style
> coding.

Add an additional sorting column, and you can preserve the input order.
Any Prolog system implementing multi-argument indexing has also to
solve this problem, in that the index lookup bust deliver a clause set
which is actually a clause list ordered by the input order.


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

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.