The SCIFF Abductive Proof-Procedure

Representing and monitoring social commitments using the event calculus

“…2 The commitment is satisfied when the property P is brought about in any time instant within the interval [T 1 , . .…”

“…The jREC tool, presented in [15], is based on the formal framework SCIFF [1,2,64]. Being this implementation based on SCIFF, it inherits all the SCIFF formal properties.…”

Conflict Resolution in Norm-Regulated Environments Via Unification and Constraints

“…The SCIFF framework [23] is related to our work in that it also uses constraint resolution to reduce the scope of expectations to avoid conflict -expectation is a concept closely related to norms [24]. For instance, in that work, E(p, X ), 0 ≤ X ≤ 10 means that p is expected to hold true between 0 and 10, and EN(p, Y ), Y > 5 means that p is expected not to hold true when Y is greater than 5; positive expectations are related to obligations (and are implicitly existentially quantified) and negative expectations are related to prohibitions (and are implicitly universally quantified).…”

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

“…The computee model is based on the KGP (Knowledge, Goals, Plans) agent architecture [101,153,152], whereas the SOCS social model is based on Social Integrity Constraints (IC S ) [1,36]. The proof-procedures to implement the operational models are the SCIF F [3] for interaction verification and CIF F [62] for temporal reasoning and planning, both of them extensions of Fung and Kowalski's IFF abductive proof-procedure [78], and Gorgias [103] for preference reasoning and deliberation, based on LPwNF [50]. A prototype of societies of computees is implemented in the PROSOCS architecture [32,2].…”