Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.physics.relativity    |    The theory of relativity    |    225,861 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 224,370 of 225,861    |
|    Mild Shock to Mild Shock    |
|    Re: 2.1 Logical variables and equations     |
|    06 Nov 25 22:42:56    |
      XPost: sci.math       From: janburse@fastmail.fm              Hi,              A Prolog logical variable is not immutable,       it transitions all the time from uninstantiated       to instantiated, during unification.              Also the value the logical variable represents       is not immutable, since it might point to a       Prolog term which is non-ground, this              Prolog term might have other Prolog logical variables,       which do also such transitions, making the       while Prolog term transitioniong from less ground              to more ground, or even worse to a larger       term with even more Prolog logical variables,       and so on, leading to the phaenomenon of              perpetual processes or concurrent logic programming.       In particular the existence quantifier ∃ in logic       programming is not unique existence ∃!. For              example the following is true:              ∃x x = f(y)              But x has not a "single value", the existence       is more witness to of a kind of skolem function       dependency, namely that for each y, there              is some f(y). What they write is only useful       for a certained moded form of Prolog and unification,       where the equations have unique existence of              ground terms or some other value domain.              Bye              Mild Shock schrieb:       > Hi,       >       > Its their take of Logical variable, which       > might not be the same as a Prolog logical variable.       >       > ------------------ cut here ----------------       >       > 2.1 Logical variables and equations       > A program executes by solving its equations, using       > the process of unification. For example,       >       > ∃x y z. x = |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca