Deontic Logic in Computer Science 10th International Conference, DEON 2010, Fiesole, Italy, July 7-9, 2010. Proceedings /

Deontic Logic in Computer Science 10th International Conference, DEON 2010, Fiesole, Italy, July 7-9, 2010. Proceedings / [electronic resource] : edited by Guido Governatori, Giovanni Sartor. - 1st ed. 2010. - VIII, 323 p. 33 illus. online resource. - Lecture Notes in Artificial Intelligence, 6181 2945-9141 ; . - Lecture Notes in Artificial Intelligence, 6181 .

From Norm Adoption to Norm Internalization -- Norms, Action and Agency in Multi-agent Systems -- Towards a Logical Analysis of the Judgment on Facts -- Deontic Redundancy: A Fundamental Challenge for Deontic Logic -- A Dyadic Operator for the Gradation of Desirability -- Deontics = Betterness + Priority -- Axioms for Obligation and Robustness with Temporal Logic -- Moral Particularism and Deontic Logic -- Relevance, Derogation and Permission -- Retroactive Legal Changes and Revision Theory in Defeasible Logic -- Towards Metalogical Systematisation of Deontic Action Logics Based on Boolean Algebra -- Avoiding Deontic Explosion by Contextually Restricting Aggregation -- Obligations and Prohibitions in Talmudic Deontic Logic -- Introducing Exclusion Logic as a Deontic Logic -- Privacy Policies with Modal Logic: The Dynamic Turn -- Value-Based Argumentation for Justifying Compliance -- A Logical Model of Private International Law -- Where Did Mally Go Wrong? -- Relationships between Actions Performed by Institutional Agents, Human Agents or Software Agents -- Characterising Responsibility in Organisational Structures: The Problem of Many Hands -- A Logical Analysis of Commitment Dynamics -- Forbidding Undesirable Agreements: A Dependence-Based Approach to the Regulation of Multi-agent Systems.

9783642141836

10.1007/978-3-642-14183-6 doi


Artificial intelligence.
Computer programming.
Compilers (Computer programs).
Machine theory.
Computer science--Mathematics.
Discrete mathematics.
Computer science.
Artificial Intelligence.
Programming Techniques.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Discrete Mathematics in Computer Science.
Theory of Computation.

Q334-342 TA347.A78

006.3
© 2024 IIIT-Delhi, library@iiitd.ac.in