Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Knowledge means ‘all’, belief means ‘most’.Dimitris Askounis, Costas D. Koutras & Yorgos Zikos - 2016 - Journal of Applied Non-Classical Logics 26 (3):173-192.
    We introduce a bimodal epistemic logic intended to capture knowledge as truth in all epistemically alternative states and belief as a generalised ‘majority’ quantifier, interpreted as truth in most of the epistemically alternative states. This doxastic interpretation is of interest in knowledge-representation applications and it also holds an independent philosophical and technical appeal. The logic comprises an epistemic modal operator, a doxastic modal operator of consistent and complete belief and ‘bridge’ axioms which relate knowledge to belief. To capture the notion (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On weak filters and ultrafilters: Set theory from (and for) knowledge representation.Costas D. Koutras, Christos Moyzes, Christos Nomikos, Konstantinos Tsaprounis & Yorgos Zikos - 2023 - Logic Journal of the IGPL 31 (1):68-95.
    Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of large subsets’ of a given index set |$I$|⁠, in the sense that it is difficult to think of a weaker, but still plausible, definition of the concept. The notion of weak ultrafilter naturally emerges and has been used in epistemic logic and other (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Defeasible inheritance systems and reactive diagrams.Dov Gabbay - 2008 - Logic Journal of the IGPL 17 (1):1-54.
    Inheritance diagrams are directed acyclic graphs with two types of connections between nodes: x → y and x ↛ y . Given a diagram D, one can ask the formal question of “is there a valid path between node x and node y?” Depending on the existence of a valid path we can answer the question “x is a y” or “x is not a y”. The answer to the above question is determined through a complex inductive algorithm on paths (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • In All But Finitely Many Possible Worlds: Model-Theoretic Investigations on ‘ Overwhelming Majority ’ Default Conditionals.Costas D. Koutras & Christos Rantsoudis - 2017 - Journal of Logic, Language and Information 26 (2):109-141.
    Defeasible conditionals are statements of the form ‘if A then normally B’. One plausible interpretation introduced in nonmonotonic reasoning dictates that ) is true iff B is true in ‘most’ A-worlds. In this paper, we investigate defeasible conditionals constructed upon a notion of ‘overwhelming majority’, defined as ‘truth in a cofinite subset of \’, the first infinite ordinal. One approach employs the modal logic of the frame \\), used in the temporal logic of discrete linear time. We introduce and investigate (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A modal logic for subjective default reasoning.Shai Ben-David & Rachel Ben-Eliyahu-Zohary - 2000 - Artificial Intelligence 116 (1-2):217-236.
    Download  
     
    Export citation  
     
    Bookmark   4 citations