Eckhard Bick - VISL

LIST = (@=c @=v @=p @=s @=t) ;
LIST = (@=e @=i @=j @=a @=h @=m @=V @=s @=d @=X @=f @=l @=T) ;
LIST = (@=c @=E @=J @=m @=v @=p @=s @=d @=l @=t) ;
LIST = (@=c @=E @=v @=p @=s @=f @=t) ;
LIST = (@=c @=E @=v @=p @=s @=d @=f @=t) ;
LIST = (@=c @=E @=m @=s @=d @=X) ;
LIST = (@=c @=h @=n @=v @=p @=d @=x @=f @=t) ;
LIST = (@=m) ;
LIST = (@=e @=i @=j @=a @=h @=m @=d @=f @=T) ;
LIST = (@=e @=i @=j @=a @=h @=m @=V @=d @=f @=T) ;
LIST = (@=c @=e @=i @=j @=a @=h @=v @=p @=x @=l) ;
LIST = (@=c @=i @=a @=h @=m @=v @=p @=x @=f @=l @=t @=S) ;
LIST = (@=e @=i @=j @=a @=h @=m @=s @=d) ;
LIST = (@=c @=e @=i @=j @=a @=h @=v @=p @=d @=l @=t) ;
LIST = (@=c @=i @=s @=d @=f) ;
LIST = (@=e @=i @=j @=a @=h @=m @=d @=f) ;
LIST = (@=i @=j @=a @=h) ;
LIST = (@=c @=p) ;
LIST = (@=c @=v @=p) ;
LIST = (@=i) ;
LIST = (@=d) ;
Feature E (entity), for instance, isn’t listed in the killing set for , but rules
discarding E will still work, since feature H (human entity) is listed, and not-H can be
inferred from not-E by:
REMOVE (@=H) (0 @=h) (NOT 0 ) ;
In the same way, it can be inferred that, if something can’t be moved (not J), then it
cannot move either (not I). These relations are not symmetric, of course: books, for
instance, cannot move (not I), but they can be moved (J).
REMOVE (@=e) (*-1 @%col LINK 0 @>N LINK NOT *1 @NON->N) (NOT 0 @%topabs) ;
REMOVE (@=e) (*1 @%col LINK 0 @N< LINK NOT *-1 @NON-N) (*1 @MV BARRIER CLB-ORD LINK 0 V-NON-HUM LINK NOT 0
V-HUM&) ;
REMOVE (@=H) (0 @SUBJ>) (*1 CLB-ORD/VFIN LINK 0 CLB-ORD LINK *1 @MV LINK *1
@MV LINK 0 V-NON-HUM LINK NOT 0 V-HUM&) ;
REMOVE (@=H) (*-1 @%jn LINK 0 @>N LINK NOT 0 @%jh LINK NOT *1 @NON->N) ;
REMOVE (@=H) (*1 @%jn LINK 0 @N< LINK NOT 0 @%jh LINK NOT *-1 @NON-N) (*1 @MV LINK 0 V-HUM LINK NOT *-1 CLB-ORD) ;
REMOVE (@=h) (0 @SUBJ>) (*1 CLB-ORD/VFIN LINK 0 CLB-ORD LINK *1 @MV LINK *1
@MV LINK 0 V-HUM) ;
REMOVE (@=h) (*-1 @%jh BARRIER @NON->N LINK 0 @>N LINK NOT 0 @%jn) ;
REMOVE (@=h) (*1 @%jh BARRIER @NON-N< LINK 0 @N< LINK NOT 0 @%jn) ;
- 380 -