3,723 Hits in 10.2 sec


2015 The Review of Symbolic Logic  
AbstractWe introduce a new understanding of deontic modals that we callobligations as weakest permissions.  ...  We now develop the core deontic logic of obligations as weakest permissions.  ...  In this paper we study the logic of what we call obligations as weakest permissions. The basic idea is this.  ... 
doi:10.1017/s1755020315000209 fatcat:74x43d4sqnhzfpzmqsouaawppe

Comments on Ralph Wedgwood's The Nature of Normativity

Richard Holton
2010 Philosophical Studies  
a requirement that plans be realizable) to argue that the correct logic for 'ought' is standard deontic logic (), that is, the deontic version of the modal logic , with the box understood as an obligation  ...  And the D axiom D: Op → ~O~p rules out, as a matter of logic, the possibility of contradictory obligations, and hence the possibility of logical dilemmas that could give rise to them. 1 So it is certainly  ... 
doi:10.1007/s11098-010-9550-z fatcat:l26mef2mm5cgjip6z5g5bjvk5q

Connecting Actions and States in Deontic Logic

Piotr Kulicki, Robert Trypuz
2017 Studia Logica: An International Journal for Symbolic Logic  
This paper tackles the problem of inference in normative systems where norms concerning actions and states of affairs appear together. A deontic logic of actions and states is proposed as a solution.  ...  They are to be derived from all norms applicable to the situation by using the principles of the logic presented in this paper.  ...  Specific Norms in the Logic Definition of the Most General (i.e., the weakest) Strong Prohibition.  ... 
doi:10.1007/s11225-017-9716-1 fatcat:acib3rwfefexznrpxw5k4l32cu

Specifying Multiagent Organizations [chapter]

Leendert van der Torre, Joris Hulstijn, Mehdi Dastani, Jan Broersen
2004 Lecture Notes in Computer Science  
To this end we use KBDIO CTL , an extension of BDI CTL in which obligations and permissions are represented by directed modal operators.  ...  We illustrate how the logic can be used by introducing and discussing various properties of normative systems and individual agents which can be represented in the logic.  ...  As usual we use the weakest version of modal entailment, i.e., ϕ |= ψ holds if and only if it is the case that when ϕ is satisfied in some state of a model, than also ψ is satisfied.  ... 
doi:10.1007/978-3-540-25927-5_16 fatcat:mljmfoujnjd73afkdj4g7fsm7i

The pragmatic oddity in norm-based deontic logics

Xavier Parent, Leendert van der Torre
2017 Proceedings of the 16th edition of the International Conference on Articial Intelligence and Law - ICAIL '17  
The ideal worlds of a possible worlds semantics may satisfy both a primary obligation and an associated secondary obligation, for example the obligation to keep a promise and the obligation to apologise  ...  This is known as the pragmatic oddity introduced by Prakken and Sergot.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous referees for their comments.  ... 
doi:10.1145/3086512.3086529 dblp:conf/icail/ParentT17 fatcat:wtf5d5hmczdhfnqvuasl7sv3su

A Case Study in Formal Verification Using Multiple Explicit Heaps [chapter]

Wojciech Mostowski
2013 Lecture Notes in Computer Science  
Commonly, a formal specification language, such as JML, hides the notion of the heap from the user.  ...  In the context of the KeY program verifier and the associated Dynamic Logic for Java we discuss the first instance of applying a generalised approach to the treatment of memory heaps in verification.  ...  The work of W. Mostowski is supported by ERC grant 258405 for the VerCors project. We would like to thank Richard Bubel for his insights and invaluable help with the implementation.  ... 
doi:10.1007/978-3-642-38592-6_3 fatcat:4kqfppxxzfdzbj5txhu25a3gi4

A structured argumentation framework for detaching conditional obligations [article]

Mathieu Beirlaen, Christian Straßer
2016 arXiv   pre-print
For the evaluation of arguments in favor of detaching obligations we use a Dung-style argumentation-theoretical semantics.  ...  We present a general formal argumentation system for dealing with the detachment of conditional obligations.  ...  The resulting systems, like DAF, allow for versions of the factual and deontic detachment rules. Moreover, they allow for the representation of permissive norms.  ... 
arXiv:1606.00339v1 fatcat:kua325ygtjfo7he7rmjvgkh2aa


Johannes Kanig, Jean-Christophe Filliâtre
2009 Proceedings of the 2009 ACM SIGPLAN workshop on ML - ML '09  
It features Effect polymorphism, higher-order logic and the possibility to reason about state in the logic, which enable highly modular specifications of generic code.  ...  The Who tool is intended to be used as an intermediate language for verification tools targeting ML-like programming languages.  ...  Acknowledgments We would like to thank the anonymous referees for their helpful comments.  ... 
doi:10.1145/1596627.1596634 fatcat:jwwi5cyvyzhtzkzka3n2p3dveq

Multiagent Deontic Logic and its Challenges from a Normative Systems Perspective

Gabriella Pigozzi, Leendert W. N. van der Torre
2017 IfColog journal of logics and their applications (FLAP)  
This special issue contains the journal version of four contributions to the Handbook of Normative Multi-Agent Systems (NorMAS), which will appear at College Publications.  ...  The articles in this special issue reflect the development of the logical analysis of normative multi-agent systems theory during the last two decades, with a special emphasis on the role played by deontic  ...  We call this a 'static' version of strong permission.  ... 
dblp:journals/flap/PigozziT17a fatcat:7z52lqgoxnaqnmxqu3uqmthnja

Agential obligation as non-agential personal obligation plus agency

Paul McNamara
2004 Journal of Applied Logic  
McNamara). 1 As noted in [21] in greater detail, the core of the agency framework employed here is an expansion of that employed in [18, 24, 25] .  ...  I explore various ways of integrating the framework for predeterminism, agency, and ability in [P. McNamara, Nordic J. Philos. Logic 5 (2) (2000) 135] with a framework for obligations.  ...  Finally, we believe that it readily solves versions of van Fraassen's largely neglected puzzle. 40  ... 
doi:10.1016/j.jal.2004.01.006 fatcat:aj5szlcrgrbadnuyrdxyty7dkm

Explosion and the Normativity of Logic

Florian Steinberger
2016 Mind  
Therefore, our logic should not recognize explosion as a logical law. Call this the 'normative argument against explosion'.  ...  Logic has traditionally been construed as a normative discipline; it sets forth standards of correct reasoning. Explosion is a valid principle of classical logic.  ...  According to it, our obligations or permissions extend only as far as our logical knowledge.  ... 
doi:10.1093/mind/fzv203 fatcat:y76gwhjwljbuxfnotai6q4uo4a

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools [chapter]

Reiner Hähnle, Marieke Huisman
2019 Lecture Notes in Computer Science  
on logical inference.  ...  We take stock of the state-of-art and give a list of the most important challenges for the further development of the field of deductive software verification.  ...  Many thanks to Richard Bubel for help with the preparation of the example in Sect. 2.  ... 
doi:10.1007/978-3-319-91908-9_18 fatcat:t3verkvbx5givfekzmbpiw6zla

Formal methods for smart cards: an experience report

C.-B. Breunesse, N. Cataño, M. Huisman, B. Jacobs
2005 Science of Computer Programming  
The reason for using JML as a specification language is that several tools are available to check (parts of) the specification w.r.t. an implementation.  ...  The application is an electronic purse implementation, developed by the smart card producer Gemplus as a test case for formal methods for smart cards.  ...  The specification of the mul method has been verified by a combination of Hoare logic and Weakest-Precondition reasoning.  ... 
doi:10.1016/j.scico.2004.05.011 fatcat:pkx6yjekqjbijjhpnielicht3a

Extended Static Checking by Calculation Using the Pointfree Transform [chapter]

José N. Oliveira
2009 Lecture Notes in Computer Science  
The close connection between such calculus and that of weakest pre-conditions makes it possible to use the latter in ESC proof obligation discharge, where pointfree notation is again used, this time to  ...  The pointfree transform offers to the predicate calculus what the Laplace transform offers to the differential/integral calculus: the possibility of changing the underlying mathematical space so as to  ...  thank the organizers of the PURECAFE meetings for the opportunity to present his first ideas about ESC/PF at one of the seminars, back to 2004 [43] .  ... 
doi:10.1007/978-3-642-03153-3_5 fatcat:yy3d4wai65abxkydksbarwnisq

A Higher-Order Logic for Concurrent Termination-Preserving Refinement [chapter]

Joseph Tassarotti, Ralf Jung, Robert Harper
2017 Lecture Notes in Computer Science  
To our knowledge, this is the first program logic capable of giving a compiler correctness proof for such a language.  ...  To demonstrate the power of these extensions, we prove the correctness of an efficient implementation of a higher-order, session-typed language.  ...  Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of these funding agencies.  ... 
doi:10.1007/978-3-662-54434-1_34 fatcat:x5yxha3jnnfupolnywifhdx6m4
« Previous Showing results 1 — 15 out of 3,723 results