On models for propositional dynamic logic
Theoretical Computer Science
Contrary-to-duty reasoning with preference-based dyadic obligations
Annals of Mathematics and Artificial Intelligence
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
Resolving Conflicts between Beliefs, Obligations, Intentions, and Desires
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Towards Socially Sophisticated BDI Agents
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Reasoning about Uncertainty
Modal logic investigations in the semantics of counts-as
ICAIL '05 Proceedings of the 10th international conference on Artificial intelligence and law
Distributed norm management in regulated multiagent systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
On the logic of normative systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the possibility theory-based semantics for logics of preference
International Journal of Approximate Reasoning
Graded BDI models for agent architectures
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
A Fuzzy Modal Logic for Belief Functions
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
Aggregation of Trust for Iterated Belief Revision in Probabilistic Logics
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
| Hi-index | 0.00 |
In this paper we define a framework to introduce gradedness in Deontic logics through the use of fuzzy modalities. By way of example, we instantiate the framework to Standard Deontic logic (SDL) formulas. Given a deontic formula 驴驴 SDL, our language contains formulas of the form $\overline{r} \to N\Phi$ or $\overline{r} \to P\Phi$, where r驴 [0, 1], expressing that the preference or probability degree respectively of a norm 驴is at least r. We present sound and complete axiomatisations for these logics.