Switch to: References

Add citations

You must login to add citations.
  1. Ceteris Paribus Conditionals and Comparative Normalcy.Martin Smith - 2006 - Journal of Philosophical Logic 36 (1):97-121.
    Our understanding of subjunctive conditionals has been greatly enhanced through the use of possible world semantics and, more precisely, by the idea that they involve variably strict quantification over possible worlds. I propose to extend this treatment to ceteris paribus conditionals – that is, conditionals that incorporate a ceteris paribus or ‘other things being equal’ clause. Although such conditionals are commonly invoked in scientific theorising, they traditionally arouse suspicion and apprehensiveness amongst philosophers. By treating ceteris paribus conditionals as a species (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • The logic of qualitative probability.James P. Delgrande, Bryan Renne & Joshua Sack - 2019 - Artificial Intelligence 275 (C):457-486.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • First order extensions of classical systems of modal logic; the role of the Barcan schemas.Horacio Arló Costa - 2002 - Studia Logica 71 (1):87-118.
    The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames. The results have interesting applications in epistemic logic. In particular we suggest that the proposed models can be used in order to study monadic operators of probability (Kyburg, 1990) and likelihood (Halpern-Rabin, 1987).
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Nonmonotonicity and the scope of reasoning.David W. Etherington, Sarit Kraus & Donald Perlis - 1991 - Artificial Intelligence 52 (3):221-261.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Fundamental concepts of qualitative probabilistic networks.Michael P. Wellman - 1990 - Artificial Intelligence 44 (3):257-303.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A proof-search system for the logic of likelihood.R. Alonderis & H. Giedra - 2020 - Logic Journal of the IGPL 28 (3):261-280.
    The cut-free Gentzen-type sequent calculus LLK for the logic of likelihood is introduced in the paper. It is proved that the calculus is sound and complete for LL. Using the introduced calculus LLK, a decision procedure for LL is presented.
    Download  
     
    Export citation  
     
    Bookmark  
  • Unifying default reasoning and belief revision in a modal framework.Craig Boutilier - 1994 - Artificial Intelligence 68 (1):33-85.
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • In conjunction with qualitative probability.Tim Fernando - 1998 - Annals of Pure and Applied Logic 92 (3):217-234.
    Numerical probabilities are eliminated in favor of qualitative notions, with an eye to isolating what it is about probabilities that is essential to judgements of acceptability. A basic choice point is whether the conjunction of two propositions, each acceptable, must be deemed acceptable. Concepts of acceptability closed under conjunction are analyzed within Keisler's weak logic for generalized quantifiers — or more specifically, filter quantifiers. In a different direction, the notion of a filter is generalized so as to allow sets with (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Non-adjunctive inference and classical modalities.Horacio Arló Costa - 2005 - Journal of Philosophical Logic 34 (5/6):581 - 605.
    The article focuses on representing different forms of non-adjunctive inference as sub-Kripkean systems of classical modal logic, where the inference from □A and □B to □A ∧ B fails. In particular we prove a completeness result showing that the modal system that Schotch and Jennings derive from a form of non-adjunctive inference in (Schotch and Jennings, 1980) is a classical system strictly stronger than EMN and weaker than K (following the notation for classical modalities presented in Chellas, 1980). The unified (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Dynamic reasoning with qualified syllogisms.Daniel G. Schwartz - 1997 - Artificial Intelligence 93 (1-2):103-167.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Plausible reasoning: a first-order approach.Silvana Badaloni & Alberto Zanardo - 1996 - Journal of Applied Non-Classical Logics 6 (3):215-261.
    Download  
     
    Export citation  
     
    Bookmark