Switch to: References

Add citations

You must login to add citations.
  1. Norm-system revision: theory and application. [REVIEW]Audun Stolpe - 2010 - Artificial Intelligence and Law 18 (3):247-283.
    This paper generalises classical revision theory of the AGM brand to sets of norms. This is achieved substituting input/output logic for classical logic and tracking the changes. Operations of derogation and amendment—analogues of contraction and revision—are defined and characterised, and the precise relationship between contraction and derogation, on the one hand, and derogation and amendment on the other, is established. It is argued that the notion of derogation, in particular, is a very important analytical tool, and that even core deontic (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Bayesian confirmation of theories that incorporate idealizations.Michael J. Shaffer - 2001 - Philosophy of Science 68 (1):36-52.
    Following Nancy Cartwright and others, I suggest that most (if not all) theories incorporate, or depend on, one or more idealizing assumptions. I then argue that such theories ought to be regimented as counterfactuals, the antecedents of which are simplifying assumptions. If this account of the logic form of theories is granted, then a serious problem arises for Bayesians concerning the prior probabilities of theories that have counterfactual form. If no such probabilities can be assigned, the the posterior probabilities will (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • The modal logic of discrepancy.Charles B. Cross - 1997 - Journal of Philosophical Logic 26 (2):143-168.
    Discrepancies between an agent's goals and beliefs play an important, if implicit, role in determining what a rational agent is motivated to do. This is most obvious in cases where an agent achieves a complex goal incrementally and must deliberate anew as each milestone is reached. In such cases the concept of goal/belief discrepancy defines an appropriate space to which a degree-of-achievement yardstick can be applied. This paper presents soundness and completeness results concerning a logic for reasoning about goal/belief discrepancy, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Declarative Representation of Revision Strategies.Gerhard Brewka - 2001 - Journal of Applied Non-Classical Logics 11 (1-2):151-167.
    In this paper we introduce a nonmonotonic framework for belief revision in which reasoning about the reliability of different pieces of information based on meta-knowledge about the information is possible, and where revision strategies can be described declaratively. The approach is based on a Poole-style system for default reasoning in which entrenchment information is represented in the logical language. A notion of inference based on the least fixed point of a monotone operator is used to make sure that all theories (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • The lexicographic closure as a revision process.Richard Booth - 2001 - Journal of Applied Non-Classical Logics 11 (1):35-58.
    The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing “if θ is true then, normally, φ is true” be said to follow from a given set of items of such information. Many answers to this question have been proposed but, surprisingly, virtually none have attempted any explicit connection to belief revision. The aim of this paper (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Conditioning by Minimizing Accessibility.Konstantinos Georgatos - 2010 - In Giacomo Bonanno, Benedikt Löwe & Wiebe Hoek (eds.), Logic and the Foundations of Game and Decision Theory €“ Loft 8. Springer Berlin Heidelberg. pp. 20-33.
    This paper presents an axiomatization of a class of set-theoretic conditional operators using minimization of the geodesic distance defined as the shortest path generated by the accessibility relation on a frame. The objective of this modeling is to define conditioning based on a notion of similarity generated by degrees of indistinguishability.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation