A Formal Language for Electronic Contracts

In this paper we propose a formal language for writing electronic contracts, based on the deontic notions of obligation, permission, and prohibition. We take an ought-to-do approach, where deontic operators are applied to actions instead of state-of-affairs. We propose an extension of the µ-calculus in order to capture the intuitive meaning of the deontic notions and to express concurrent actions. We provide a translation of the contract language into the logic, the semantics of which faithfully captures the meaning of obligation, permission and prohibition. We also show how our language captures most of the intuitive desirable properties of electronic contracts, as well as how it avoids most of the classical paradoxes of deontic logic. We finally show its applicability on a contract example.

[1]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Mihaela Sighireanu,et al.  Efficient on-the-fly model-checking for regular alternation-free mu-calculus , 2003, Sci. Comput. Program..

[3]  Jens Dietrich,et al.  A Logic Based SLA Management Framework , 2005 .

[4]  V. Sánchez Valencia Handbook of the History of Logic, volume 3 , 2004 .

[5]  Igor Walukiewicz,et al.  A Complete Deductive System for the mu-Calculus , 1995 .

[6]  Gerardo Schneider,et al.  Towards a formal definition of electronic contracts , 2007 .

[7]  Aspassia Daskalopulu,et al.  Model Checking Contractual Protocols , 2001, ArXiv.

[8]  Dov M. Gabbay,et al.  Handbook of the history of logic , 2004 .

[9]  Vladimir Tosic,et al.  On comprehensive contractual descriptions of Web services , 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

[10]  Igor Walukiewicz,et al.  Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..

[11]  Richard E. Ladner,et al.  Propositional modal logic of programs , 1977, STOC '77.

[12]  Dexter Kozen,et al.  On Kleene Algebras and Closed Semirings , 1990, MFCS.

[13]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[14]  I. V. Ramakrishnan,et al.  CTR-S: a logic for specifying contracts in semantic web services , 2004, WWW Alt. '04.

[15]  Vaughan R. Pratt A practical decision method for propositional dynamic logic (Preliminary Report) , 1978, STOC '78.

[16]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[17]  Santosh K. Shrivastava,et al.  Run-time monitoring and enforcement of electronic contracts , 2004, Electron. Commer. Res. Appl..

[18]  Jan Oyvind Aagedal,et al.  Quality of Service Support in Development of Distributed Systems , 2001 .

[19]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[20]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[21]  T. S. E. Maibaum,et al.  Towards electronic contract performance , 2001, 12th International Workshop on Database and Expert Systems Applications.

[22]  Henry Prakken,et al.  Contrary-to-duty obligations , 1996, Stud Logica.

[23]  Floris Bex,et al.  Legal Knowledge and Information Systems. JURIX 2006 , 2006 .

[24]  K. Roberts,et al.  Capillary electrophoretic separation of nanoparticles , 2011, Analytical and bioanalytical chemistry.

[25]  Guido Governatori,et al.  Logic of Violations: A gentzen systems for reasoning with contrary-to-duty obligations , 2006 .

[26]  Jan M. Broersen Action negation and alternative reductions for dynamic deontic logics , 2004, J. Appl. Log..

[27]  Paul McNamara,et al.  Deontic logic , 2006, Logic and the Modalities in the Twentieth Century.

[28]  Ernst Mally,et al.  Grundgesetze des Sollens : Elemente der Logik des Willens , 1926 .

[29]  Armin Biere,et al.  µcke - Efficient µ-Calculus Model Checking , 1997, CAV.

[30]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[31]  Fred Krögr Temporal Logic Of Programs , 1987 .

[32]  Vaughan R. Pratt,et al.  Dynamic algebras and the nature of induction , 1980, STOC '80.

[33]  Rohit Parikh,et al.  A Decision Procedure for the Propositional µ-Calculus , 1983, Logic of Programs.

[34]  Georg Henrik Deontic Logic: A Personal View , 1999 .

[35]  Jean-Marc Jézéquel,et al.  Making Components Contract Aware , 1999, Computer.

[36]  Enrico Motta,et al.  The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings , 2005, SEMWEB.

[37]  Branislav Rovan Mathematical Foundations of Computer Science 1990 , 1990, Lecture Notes in Computer Science.

[38]  John-Jules Ch. Meyer,et al.  A different approach to deontic logic: deontic logic viewed as a variant of dynamic logic , 1987, Notre Dame J. Formal Log..

[39]  E. Mally Grundgesetze des Sollens , .

[40]  Guido Governatori,et al.  Representing business contracts in RuleML , 2005, Int. J. Cooperative Inf. Syst..

[41]  Igor Walukiewicz,et al.  Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[42]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[43]  Igor Walukiewicz A Complete Deductive System for the-Calculus , 1995, LICS 1995.

[44]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[45]  Roel Wieringa,et al.  A Fixed-point Characterization of a Deontic Logic of Regular Action , 2001, Fundam. Informaticae.

[46]  Guido Governatori,et al.  Nested Rules in Defeasible Logic , 2005, RuleML.