Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
In modal logic, when adding a syntactic property to an axiomatisation, this property will semantically become true in all models, in all situations, under all circumstances. For i...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
We describe a policy language and implement its associated proof checking system. In our system, agents can distribute data along with usage policies in a decentralized architectu...
J. G. Cederquist, Ricardo Corin, M. A. C. Dekker, ...
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...