Frames in the space of situations (research note)
Artificial Intelligence
Preferred answer sets for extended logic programs
Artificial Intelligence
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
Flexible protocol specification and execution: applying event calculus planning using commitments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Distributed and Parallel Databases
A Social Semantics for Agent Communication Languages
Issues in Agent Communication
Planning under Incomplete Knowledge
CL '00 Proceedings of the First International Conference on Computational Logic
Defining interaction protocols using a commitment-based agent communication language
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Specification and verification of agent interaction protocols in a logic-based system
Proceedings of the 2004 ACM symposium on Applied computing
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
A framework for compiling preferences in logic programs
Theory and Practice of Logic Programming
YAWL: yet another workflow language
Information Systems
Auditing Business Process Compliance
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Beyond soundness: on the verification of semantic business process models
Distributed and Parallel Databases
Producing compliant interactions: conformance, coverage, and interoperability
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Temporal deontic action logic for the verification of compliance to norms in ASP
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law
| Hi-index | 0.00 |
In this paper we address the problem of verifying business process compliance with norms. To this end, we employ reasoning about actions in a temporal action theory. The action theory is defined through a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DLTL). The temporal action theory allows us to formalize a business process as a temporal domain description, possibly including temporal constraints. Obligations in norms are captured by the notion of commitment, which is borrowed from the social approach to agent communication. Norms are represented using (possibly) non monotonic causal laws which (possibly) enforce new obligations. In this context, verifying compliance amounts to verify that no execution of the business process leaves some commitment unfulfilled. Compliance verification can be performed by Bounded Model Checking.