We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and ena...
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
— In this paper we study the rational balance between local and global policies in virtual communities of agents. To study this problem we use a logical framework for modelling o...
—Usage control goes beyond traditional access control, addressing its limitations related to attribute mutability and continuous usage permission validation. The recently propose...
Rafael Teigao, Carlos Maziero, Altair Olivo Santin