Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: (OT) Pushing inductive systems to their limit

by Anonymous Monk
on Jul 29, 2005 at 22:54 UTC ( #479542=note: print w/ replies, xml ) Need Help??


in reply to (OT) Pushing inductive systems to their limit

This sounds very much like constraint programming to me. For the most part, unification is an equality constraint between two variables. If the two are unbound, there's no change, if one is bound, the value is propagated to the other, if both are bound, the values must be equivalent or the network is inconsistent. On an inconsistency, remove the last constraint and try placing it somewhere else. The more complex "conditional unification" you're talking about are procedural constraints; the constraint is satisfied iff the body of the URI matches the HTML.
You may want to look at this.


Comment on Re: (OT) Pushing inductive systems to their limit

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://479542]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (12)
As of 2014-07-25 21:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (175 votes), past polls