Algorithms for tractable compliance problems

Checking Regulatory Compliance: Will We Live to See It?

“…Given these properties, we identify 8 variants. The computational complexity for some of these variants has already been studied by Colombo Tosatto et al [22,23], showing that the upper bound complexity of the variants of the problem considered in the present paper is NP-complete, while the lower bound is in P.…”

Business Process Compliance: An Abstract Normative Framework

“…e basic deontic e ects are: obligation, prohibition and permission. 2 Let us start by consider the basic de nitions for such concepts: 3 Obligation A situation, an act, or a course of action to which a bearer is legally bound, and if it is not achieved or performed results in a violation. Prohibition A situation, an act, or a course of action which a bearer should avoid, and if it is achieved results in a violation.…”

“…e resulting framework can be used for several purposes: a rst possible use is to study formal properties of business process compliance, for example, the computational complexity of the problem of determining whether a given business process complies with a speci c regulation [3], and to possibly identify tractable subclasses; a second application is to provide a precise ground to compare di erent approaches to business process compliance, to identify gaps in the modelling of the normative requirement, and to assess their suitability to model business process compliance [15].…”

“…ere are other deontic e ects, but these can be derived from the basic ones, see[22] 3. Here we consider the de nition of such concepts given by the OA-SIS LegalRuleML working group.…”