Abstract
Real life contracts imply commitments which are active during their running window, with effects on both normal runs as well as in the case of exceptions. We have defined defeasible commitment machines (DCMs) to provide more flexibility. As an extension to the task dependency model for the supply chain we propose the commitment dependency network (CDN) to monitor contracts between members of the supply chain. The workings of the DCMs in the CDN is shown by a simple scenario with supplier, producer, and consumer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Walsh, W., Wellman, E.: Decentralized supply chain formation: A market protocol and competitive equilibrium analysis. Journal of Artificial Intelligence Research 19, 513–567 (2003)
Letia, I.A., Groza, A.: Agreeing on defeasible commitments. In: Declarative Agent Languages and Technologies, Hakodate, Japan (2006)
Governatori, G., Rotolo, A., Sartor, G.: Temporalised normative positions in defeasible logic. In: 10th International Conference on Artificial Inteligence and Law, Bologna, Italy (2005)
Chopra, A.K., Singh, M.P.: Nonmonotonic commitment machines. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS, vol. 2922, pp. 183–200. Springer, Heidelberg (2004)
Letia, I.A., Groza, A.: Automating the dispute resolution in a task dependency network. In: Skowron, A. (ed.) Intelligent Agent Technology, Compiegne, France, pp. 365–371 (2005)
Mallya, A.U., Yolum, P., Singh, M.P.: Resolving commitments among autonomous agents. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS, vol. 2922, pp. 166–182. Springer, Heidelberg (2004)
Wan, F., Singh, M.: Formalizing and achieving multiparty agreements via commitments. In: 4th International Joint Conference on Autonomous Agents and Multiagent Systems, Utrecht, The Netherlands, pp. 770–777. ACM Press, New York (2005)
Winikoff, M., Liu, W., Harland, J.: Enhancing commitment machines. In: Leite, J., Omicini, A., Torroni, P., Yolum, p. (eds.) DALT 2004. LNCS, vol. 3476, pp. 198–220. Springer, Heidelberg (2005)
Mallya, A.U., Singh, M.P.: Modeling exceptions via commitment protocols. In: 4th International Joint Conference on Autonomous Agents and Multiagent Systems, Utrecht, The Netherlands, pp. 122–129. ACM Press, New York (2005)
Bibel, L.W.: AI and the conquest of complexity in law. Artificial Intelligence and Law 12, 159–180 (2004)
Craswell, R.: Contract law: General theories. In: Bouckaert, B., Geest, G.D. (eds.) Encyclopedia of Law and Economics. The Regulation of Contracts, Cheltenham, vol. III, pp. 1–24 (2000)
Governatori, G.: Representing business contracts in RuleML. Journal of Cooperative Information Systems 14 (2005)
Grosof, B.: Representing E-Commerce rules via situated courteous logic programs in RuleML. Electronic Commerce Research and Applications 3, 2–20 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Letia, I.A., Groza, A. (2006). Running Contracts with Defeasible Commitment. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_12
Download citation
DOI: https://doi.org/10.1007/11779568_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)