ExtenSion of Prolog to handle a clauSal SubSet of firSt-order temporal logic with diScrete time. PropoSed by M. Abadi and Z. Manna of Stanford UniverSity. ["Temporal Logic in Programming", M. Abadi et al, INtl Symp Logic Prog pp.4-16 (1987)].

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ = ] [ ad ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ au ] [ b ] [ ba ] [ bS ] [ by ] [ ch ] [ cl ] [ cr ] [ de ] [ diSc ] [ du ] [ E ] [ ed ] [ er ] [ et ] [ fi ] [ file ] [ firSt-order ] [ fo ] [ for ] [ gi ] [ gr ] [ h ] [ handle ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ iS ] [ it ] [ la ] [ Lex ] [ M ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nf ] [ ng ] [ ni ] [ nn ] [ nS ] [ op ] [ ph ] [ Prolog ] [ query ] [ rc ] [ re ] [ rete ] [ ro ] [ S ] [ Sa ] [ Sc ] [ Se ] [ Set ] [ Si ] [ Sit ] [ St ] [ Stanford UniverSity ] [ Su ] [ T ] [ Tempo ] [ temporal logic ] [ th ] [ to ] [ uS ] [ ve ] [ Z ]