Switch to: References

Add citations

You must login to add citations.
  1. A Geometry of Approximation: Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns.Piero Pagliani & Mihir Chakraborty - 2008 - Dordrecht, Netherland: Springer.
    'A Geometry of Approximation' addresses Rough Set Theory, a field of interdisciplinary research first proposed by Zdzislaw Pawlak in 1982, and focuses mainly on its logic-algebraic interpretation. The theory is embedded in a broader perspective that includes logical and mathematical methodologies pertaining to the theory, as well as related epistemological issues. Any mathematical technique that is introduced in the book is preceded by logical and epistemological explanations. Intuitive justifications are also provided, insofar as possible, so that the general perspective is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond.George Gargov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):195-283.
    ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  • The Family of Stable Models.Melvin Fitting - unknown
    The family of all stable models for a logic program has a surprisingly simple overall structure, once two naturally occurring orderings are made explicit. In a so-called knowledge ordering based on degree of definedness, every logic program P has a smallest stable model, sk P — it is the well-founded model. There is also a dual largest stable model, S k P, which has not been considered before. There is another ordering based on degree of truth. Taking the meet and (...)
     
    Export citation  
     
    Bookmark   8 citations