Switch to: References

Add citations

You must login to add citations.
  1. Truth definitions in finite models.Leszek Aleksander Kołodziejczyk - 2004 - Journal of Symbolic Logic 69 (1):183-200.
    The paper discusses the notion of finite model truth definitions (or FM-truth definitions), introduced by M. Mostowski as a finite model analogue of Tarski's classical notion of truth definition. We compare FM-truth definitions with Vardi's concept of the combined complexity of logics, noting an important difference: the difficulty of defining FM-truth for a logic ᵍ does not depend on the syntax of L, as long as it is decidable. It follows that for a natural ᵍ there exist FM-truth definitions whose (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Semantics and complexity of recursive aggregates in answer set programming.Wolfgang Faber, Gerald Pfeifer & Nicola Leone - 2011 - Artificial Intelligence 175 (1):278-298.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Abstraction for non-ground answer set programs.Zeynep G. Saribatur, Thomas Eiter & Peter Schüller - 2021 - Artificial Intelligence 300 (C):103563.
    Download  
     
    Export citation  
     
    Bookmark