References of "Governatori, Guido"
     in
Bookmark and Share    
See detailRuleML+RR 2019 Doctoral Consortium and Rule Challenge
Soylu, Ahmet; Moschoyiannis, Sotiris; Governatori, Guido et al

Book published by CEUR-WS.org (2019)

Detailed reference viewed: 10 (1 UL)
Full Text
Peer Reviewed
See detailLegal Reasoning and Big Data: Opportunities and Challenges
Antoniou, Grigoris; Baryannis, George; Batsakis, Sotiris et al

in Legal Reasoning and Big Data: Opportunities and Challenges (2018)

Detailed reference viewed: 70 (4 UL)
Full Text
Peer Reviewed
See detailAlgorithms for tractable compliance problems
Colombo Tosatto, Silvano UL; Kelsen, Pierre UL; Ma, Qin UL et al

in Frontiers of Computer Science (2015), 9(1), 55-74

In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this ... [more ▼]

In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this problem, namely verifying whether a structured business process is compliant with a single global obligation. Global obligations are those whose validity spans for the entire execution of a business process. We identify two types of obligations: achievement and maintenance. In the present paper we firstly define an abstract framework capable to model the problem and secondly we define procedures and algorithms to deal with the compliance problem of checking the compliance of a structured business process with respect to a single global obligation. We show that the algorithms proposed in the paper run in polynomial time. [less ▲]

Detailed reference viewed: 131 (14 UL)
Full Text
Peer Reviewed
See detailBusiness Process Regulatory Compliance is Hard
Colombo Tosatto, Silvano UL; Kelsen, Pierre UL; Governatori, Guido

in IEEE Transactions on Services Computing (2015), 8(6), 958-970

Verifying whether a business process is compliant with a regulatory framework is a difficult task. In the present paper we prove the hardness of the business process regulatory compliance problem by ... [more ▼]

Verifying whether a business process is compliant with a regulatory framework is a difficult task. In the present paper we prove the hardness of the business process regulatory compliance problem by taking into account a sub-problem of the general problem. This limited problem allows to verify only the compliance of structured processes with respect to a regulatory framework composed of a set of conditional obligations including a deadline. Experimental evidence from existing studies shows that compliance is a difficult task. In this paper, despite considering a sub-problem of the general problem, we provide some theoretical evidence of the difficulty of the task. In particular we show that the source of the complexity lies in the core language of verifying conditional obligations with a deadline. We prove that for this simplified case verifying partial compliance belongs to the class of NP-complete problems, and verifying full compliance belongs to the class of coNP-complete problems. Thus by proving the difficulty of a simplified compliance problem we prove that the general problem of verifying business process regulatory compliance is hard. [less ▲]

Detailed reference viewed: 126 (21 UL)
Full Text
Peer Reviewed
See detailSocial Interaction Based Audience Segregation for Online Social Networks.
van der Torre, Leon UL; Ahmed, Javed; Governatori, Guido et al

in Proceedings of the European Conference on Social Intelligence (2014)

Online social networking is the latest craze that has captured the attention of masses, people use these sites to communicate with their friends and family. These sites o er attractive means of social ... [more ▼]

Online social networking is the latest craze that has captured the attention of masses, people use these sites to communicate with their friends and family. These sites o er attractive means of social interac- tions and communications, but also raise privacy concerns. This paper examines user's abilities to control access to their personal information posted in online social networks. Online social networks lack common mechanism used by individuals in their real life to manage their privacy. The lack of such mechanism signi cantly a ects the level of user control over their self presentation in online social networks. In this paper, we present social interaction based audience segregation model for online so- cial networks. This model mimics real life interaction patterns and makes online social networks more privacy friendly. Our model uses type, fre- quency, and initiation factor of social interactions to calculate friendship strength. The main contribution of the model is that it considers set of all possible interactions among friends and assigns a numerical weight to each type of interaction in order to increase or decrease its contribu- tion in calculation of friendship strength based on its importance in the development of relationship ties. [less ▲]

Detailed reference viewed: 42 (4 UL)
Full Text
Peer Reviewed
See detailDetecting Deontic Conflicts in Dynamic Settings
Colombo Tosatto, Silvano UL; Kelsen, Pierre UL; Governatori, Guido

in Cariani, Fabrizio; Grossi, Davide; Meheus, Joke (Eds.) et al Deontic Logic and Normative Systems 12th International Conference, DEON 2014, Ghent, Belgium, July 12-15, 2014. Proceedings (2014)

Regulations, through the use of obligations and permissions, are widely used in modern society to define acceptable behaviours. Thus it is indeed important that these regulations do not conflict with each ... [more ▼]

Regulations, through the use of obligations and permissions, are widely used in modern society to define acceptable behaviours. Thus it is indeed important that these regulations do not conflict with each other and contain contradicting obligations. In the present paper we focus on identifying conflicts between obligations in dynamic settings. We first show the need of an alternative semantics rather than the more classic modelled by standard deontic logic. Second we introduce a new semantics for the obligations capable of representing and reasoning about them in these dynamic settings, and lastly we use it to identify the necessary and sufficient conditions to identify conflicting obligations. [less ▲]

Detailed reference viewed: 83 (2 UL)
Full Text
Peer Reviewed
See detailTowards an Abstract Framework for Compliance
Colombo Tosatto, Silvano UL; Governatori, Guido; Kelsen, Pierre UL

in Bagheri, Ebrahim; Gasevic, Dragan; Halle, Sylvain (Eds.) et al Proceedings of the 17th IEEE International EDOC 2013 Conference Workshops, Vancouver, Canada, 9 September 2013. (2013, September 09)

The present paper aims at providing an abstract framework to define the regulatory compliance problem. In particular we show how the framework can be used to solve the problem of deciding whether a ... [more ▼]

The present paper aims at providing an abstract framework to define the regulatory compliance problem. In particular we show how the framework can be used to solve the problem of deciding whether a structured process is compliant with a single regulation, which is composed of a primary obligation and a chain of compensations. [less ▲]

Detailed reference viewed: 99 (8 UL)
Full Text
Peer Reviewed
See detailAlgorithms for Basic Compliance Problems
Colombo Tosatto, Silvano UL; El Kharbili, Marwane UL; Governatori, Guido et al

in 2nd International Workshop on Engineering Safety and Security Systems, ESSS 2013. (2013, March)

The present paper focuses on the problems of verifying compliance for global achievement and maintenance obligations. We first introduce the elements needed to identify and study compliance to these two ... [more ▼]

The present paper focuses on the problems of verifying compliance for global achievement and maintenance obligations. We first introduce the elements needed to identify and study compliance to these two classes of obligations in processes. Additionally, we define procedures and algorithms to efficiently deal with the identified compliance problem. We finally show that both algorithms proposed in the paper belong to the complexity class P. [less ▲]

Detailed reference viewed: 152 (13 UL)
Full Text
Peer Reviewed
See detailNormative Multi-Agent Systems
Andrighetto, Giulia; Governatori, Guido; Noriega, Pablo et al

in Dagstuhl Reports (2012), 2(3), 23-49

Normative systems are systems in the behavior of which norms play a role and which need normative concepts in order to be described or specified. A normative multi-agent system combines models for ... [more ▼]

Normative systems are systems in the behavior of which norms play a role and which need normative concepts in order to be described or specified. A normative multi-agent system combines models for normative systems (dealing for example with obligations, permissions and prohibitions) with models for multi-agent systems. Norms have been proposed in multi-agent systems and computer science to deal with issues of coordination, security, electronic commerce and institutions, agent organization. However, due to the lack of a unified theory, many multi-agent system researchers are presently developing their own ad hoc concepts and applications. The aim of this Dagstuhl Seminar was to formulate a collective appraisal of the current perspectives in the field and the most promising venues for future activity. In particular, the seminar has been conceived for the writing of a volume titled "A Prospective view of Normative Multi Agent Systems" aimed to become a standard reference in the field and to provide guidelines for future research in normative multi-agent systems. [less ▲]

Detailed reference viewed: 59 (1 UL)
Full Text
Peer Reviewed
See detailA Logical Understanding of Legal Interpretation
Boella, Guido UL; Governatori, Guido; Rotolo, Antonino et al

in KR 2010 (2010)

If compliance with a norm does not achieve its purpose, then its applicability must dynamically be restricted or expanded. Legal interpretation is a mechanism from law allowing norms to be adapted to ... [more ▼]

If compliance with a norm does not achieve its purpose, then its applicability must dynamically be restricted or expanded. Legal interpretation is a mechanism from law allowing norms to be adapted to unforeseen situations. We model this mechanism for norms regulating computer systems by representing the purpose of norms by social goals and by revising the constitutive rules defining the applicability of norms. We illustrate the interpretation mechanism by examples. [less ▲]

Detailed reference viewed: 59 (0 UL)
Peer Reviewed
See detailTime and Defeasibility in FIPA ACL Semantics
Rotolo, Antonino; Boella, Guido; Governatori, Guido et al

in Proceedings of WLIAMAS 2008 (2008)

Inferences about speech acts are often conditional, nonmonotonic, and involve the issue of time. Most agent communication languages, however, ignore these issues, due to the difficulty to combine them in ... [more ▼]

Inferences about speech acts are often conditional, nonmonotonic, and involve the issue of time. Most agent communication languages, however, ignore these issues, due to the difficulty to combine them in a single formalism. This paper addresses such issues in defeasible logic, and shows how to express a semantics for ACLs in order to make nonmonotonic inferences on the basis of speech acts. [less ▲]

Detailed reference viewed: 92 (7 UL)