Changes by: Yegor Bryukhov (ybryukhov at gmail.com)
Date: 2008-06-26 08:01:47 -0700 (Thu, 26 Jun 2008)
Revision: 13071
Log message:

      Our attempt to implement s4-to-lp realization algorithm in Prolog.
     It seems like a wrong path:
     1. The algorithm has little need for search and backtracking
     2. On different stages the same objects behave like variables or like literals
     3. Prolog is not very good at data abstraction, lacks dot notation. We already have 5-way predicates and at becomes tedious ...

Changes by: Yegor Bryukhov (ybryukhov at gmail.com)
Date: 2008-06-26 19:19:39 -0700 (Thu, 26 Jun 2008)
Revision: 13072
Log message:

      small progress towards s4-to-lp relaization algorithm

Changes by: Yegor Bryukhov (ybryukhov at gmail.com)
Date: 2008-06-27 13:29:56 -0700 (Fri, 27 Jun 2008)
Revision: 13075
Log message:

      the first approximation of realization for propositional rules finished.

Changes by: Yegor Bryukhov (ybryukhov at gmail.com)
Date: 2008-06-27 15:50:41 -0700 (Fri, 27 Jun 2008)
Revision: 13076
Log message:

      finished easy cases of third phase of realization

Changes by: Yegor Bryukhov (ybryukhov at gmail.com)
Date: 2008-06-30 10:49:21 -0700 (Mon, 30 Jun 2008)
Revision: 13078
Log message:

      third phase is roughly finished.
     next step - family assignment (phases 1,2)