Guido Governatori

Prof. Guido Governatori

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2018 in ACM Transactions on Management Information Systems
Verified
Journal Article
Open access
JMJan Mendling
Jan Mendling
IWIngo Weber
Ingo Weber
Wil M.P. van der AalstWil M.P. van der Aalst
Wil M.P. van der Aalst
JBJan Vom Brocke
Jan Vom Brocke
CCCristina Cabanillas
Cristina Cabanillas
LZLiming Zhu
Liming Zhu
Blockchain technology offers a sizable promise to rethink the way interorganizational business processes are managed because of its potential to realize execution without a central party serving as a single point of trust (and failure). To stimulate research on this promise and the limits thereof, in this article, we outline the challenges and opportunities of blockchain for business process management (BPM). We first reflect how blockchains could be used in the context of the established BPM lifecycle and second how they might become relevant beyond. We conclude our discourse with a summary of seven research directions for investigating the application of blockchain technology in the context of BPM.

8 September 2016
Verified
Book Chapter
Closed access
PDF file
IWIngo Weber
Ingo Weber
XXXiwei Xu
Xiwei Xu
RRRégis Riveret
Régis Riveret
GGGuido Governatori
Guido Governatori
APAlexander Ponomarev
Alexander Ponomarev
JMJan Mendling
Jan Mendling

1 April 2001 in ACM Transactions on Computational Logic
Verified
Journal Article
Open access
GAGrigoris Antoniou
Grigoris Antoniou
DBDavid Billington
David Billington
GGGuido Governatori
Guido Governatori
MMMichael J. Maher
Michael J. Maher
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.

31 August 2007
Verified
Book Chapter
Closed access
PDF file
SSShazia Sadiq
Shazia Sadiq
GGGuido Governatori
Guido Governatori
KNKioumars Namiri
Kioumars Namiri

5 March 2018 in Artificial Intelligence and Law
Verified
Journal Article
Closed access
PDF file
GGGuido Governatori
Guido Governatori
FIFlorian Idelberger
Florian Idelberger
ZMZoran Milosevic
Zoran Milosevic
RRRegis Riveret
Regis Riveret
GSGiovanni Sartor
Giovanni Sartor
XXXiwei XU
Xiwei XU

1 October 2004 in Journal of Logic and Computation
Verified
Journal Article
Open access
PDF file
GGGuido Governatori
Guido Governatori
MMMichael J. Maher
Michael J. Maher
GAGrigoris Antoniou
Grigoris Antoniou
DBDavid Billington
David Billington
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. This paper establishes significant links between defeasible reasoning and argumentation. In particular, Dung-like argumentation semantics is provided for two key defeasible logics, of which one is ambiguity propagating and the other ambiguity blocking. There are several reasons for the significance of this work: (a) establishing links between formal systems leads to a better understanding and cross-fertilization, in particular our work sheds light on the argumentation-theoretic features of defeasible logic; (b) we provide the first ambiguity blocking Dung-like argumentation system; (c) defeasible reasoning may provide an efficient implementation platform for systems of argumentation; and (d) argumentation-based semantics support a deeper understanding of defeasible reasoning, especially in the context of the intended applications.