首页 | 本学科首页   官方微博 | 高级检索  
     


Contract automata
Authors:Shaun Azzopardi  Gordon J. Pace  Fernando Schapachnik  Gerardo Schneider
Affiliation:1.Department of Computer Science,University of Malta,Msida,Malta;2.Departamento de Computación, FCEyN,Universidad de Buenos Aires,Buenos Aires,Argentina;3.Department of Computer Science and Engineering,University of Gothenburg,Gothenburg,Sweden
Abstract:Deontic logic as a way of formally reasoning about norms, an important area in AI and law, has traditionally concerned itself about formalising provisions of general statutes. Despite the long history of deontic logic, given the wide scope of the logic, it is difficult, if not impossible, to formalise all these notions in a single formalism, and there are still ongoing debates on appropriate semantics for deontic modalities in different contexts. In this paper, we restrict our attention to contracts between interactive parties, which are both general enough to be an interesting object of study but specific enough so as to narrow down the debates regarding the meaning of modalities, and present a formalism for reasoning about them.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号