Switch to: Citations

Add references

You must login to add references.
  1. Common sense and maximum entropy.Jeff Paris - 1998 - Synthese 117 (1):75-93.
    This paper concerns the question of how to draw inferences common sensically from uncertain knowledge. Since the early work of Shore and Johnson (1980), Paris and Vencovská (1990), and Csiszár (1989), it has been known that the Maximum Entropy Inference Process is the only inference process which obeys certain common sense principles of uncertain reasoning. In this paper we consider the present status of this result and argue that within the rather narrow context in which we work this complete and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  • On Inferences from Inconsistent Premises.Nicholas Rescher & Ruth Manor - 1970 - Theory and Decision 1 (2):179-217, 1970-1971.
    The main object of this paper is to provide the logical machinery needed for a viable basis for talking of the ‘consequences’, the ‘content’, or of ‘equivalences’ between inconsistent sets of premisses.With reference to its maximal consistent subsets (m.c.s.), two kinds of ‘consequences’ of a propositional set S are defined. A proposition P is a weak consequence (W-consequence) of S if it is a logical consequence of at least one m.c.s. of S, and P is an inevitable consequence (I-consequence) of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   76 citations  
  • Proof systems for probabilistic uncertain reasoning.J. Paris & A. Vencovská - 1998 - Journal of Symbolic Logic 63 (3):1007-1039.
    The paper describes and proves completeness theorems for a series of proof systems formalizing common sense reasoning about uncertain knowledge in the case where this consists of sets of linear constraints on a probability function.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Measuring inconsistency.Kevin Knight - 2002 - Journal of Philosophical Logic 31 (1):77-98.
    I provide a method of measuring the inconsistency of a set of sentences from 1-consistency, corresponding to complete consistency, to 0-consistency, corresponding to the explicit presence of a contradiction. Using this notion to analyze the lottery paradox, one can see that the set of sentences capturing the paradox has a high degree of consistency (assuming, of course, a sufficiently large lottery). The measure of consistency, however, is not limited to paradoxes. I also provide results for general sets of sentences.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  • A logical measure function.John G. Kemeny - 1953 - Journal of Symbolic Logic 18 (4):289-308.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  • A Logical Measure Function.John G. Kemeny - 1954 - Journal of Symbolic Logic 19 (4):301-302.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Intuitive semantics for first-degree entailments and 'coupled trees'.J. Michael Dunn - 1976 - Philosophical Studies 29 (3):149-168.
  • The Mathematical Theory of Communication.Claude E. Shannon & Warren Weaver - 1949 - University of Illinois Press.
    Scientific knowledge grows at a phenomenal pace--but few books have had as lasting an impact or played as important a role in our modern world as The Mathematical Theory of Communication, published originally as a paper on communication theory more than fifty years ago. Republished in book form shortly thereafter, it has since gone through four hardcover and sixteen paperback printings. It is a revolutionary work, astounding in its foresight and contemporaneity. The University of Illinois Press is pleased and honored (...)
    Direct download  
     
    Export citation  
     
    Bookmark   640 citations  
  • The uncertain reasoner's companion: a mathematical perspective.J. B. Paris - 1994 - New York: Cambridge University Press.
    Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise self-contained, collecting together the key results on the subject, and formalising within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences of the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy.J. E. Shore & R. W. Johnson - 1980 - IEEE Transactions on Information Theory:26-37.
  • Logic of Paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219-241.
  • Proof Systems for Probabilistic Uncertain Reasoning.J. Paris & A. Vencovska - 1998 - Journal of Symbolic Logic 63 (3):1007-1039.
    The paper describes and proves completeness theorems for a series of proof systems formalizing common sense reasoning about uncertain knowledge in the case where this consists of sets of linear constraints on a probability function.
     
    Export citation  
     
    Bookmark   2 citations  
  • Sul Significato Soggettivo della Probabilittextà.Bruno De Finetti - 1931 - Fundamenta Mathematicae 17:298--329.
     
    Export citation  
     
    Bookmark   65 citations  
  • On semantic information.Jaakko Hintikka - 1970 - In Hermann Bondi, Wolfgang Yourgrau & Allen duPont Breck (eds.), Physics, Logic, and History. New York: Plenum Press. pp. 147--172.