rndmcnlly

#begin_lua
  function args(t)
    if Val.type(t) == Val.FUNC then
      local res = t:args()
      res.n = nil
      return res
    else
      return {}
    end
  end

rndmcnlly

#begin_lua

  function collect(pred,arity)
    local t = {}
    Assignment.begin(pred,arity)
    while Assignment.next() do
      if Assignment.isTrue() then
        table.insert(t,Assignment.args())
      end

rndmcnlly

rndmcnlly

#begin_lua function min(a,b) return math.min(a,b) end #end_lua.

%% Adam's minimal event calculus formalism:
%% - only true holds/happens are tracked
%% - all fluents are always inertial
%% - time is a totally ordered contiguous integer sequence
%% - events and fluents are self-contained terms
%% - T variables always come first for easy sorting
initiated(T,F) :- happens(T,E), initiates(T,E,F).

rndmcnlly

rndmcnlly

rndmcnlly

rndmcnlly

rndmcnlly

rndmcnlly