A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
ScIFF is a declarative language, based on abductive logic programming, that accommodates forward rules, predicate definitions, and constraints over finite domain variables. Its abductive declarative semantics can be related to that of deontic operators; its operational specification is the sound and complete ScIFF proof procedure, defined as a set of transition rules implemented and integrated into a reasoning and verification tool. A variation of the ScIFF proof procedure (g-ScIFF) can be useddoi:10.2753/jec1086-4415120401 fatcat:a3z4aggtxjfzxgcx24ceoppu2u