4 found
  1.  43
    Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
    Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal (...)
    Direct download (5 more)  
    Export citation  
    Bookmark   14 citations  
  2.  12
    Complexity of some problems in modal and superintuitionistic logics.Larisa Maksimova & Andrei Voronkov - 2000 - Bulletin of Symbolic Logic 6:118-119.
  3. The ground-negative fragment of first-order logic is πp2-complete.Andrei Voronkov - 1999 - Journal of Symbolic Logic 64 (3):984 - 990.
    We prove that for a natural class of first-order formulas the validity problem is Π p 2 -complete.
    Direct download (7 more)  
    Export citation  
  4.  14
    Translating regular expression matching into transducers.Yuto Sakuma, Yasuhiko Minamide & Andrei Voronkov - 2012 - Journal of Applied Logic 10 (1):32-51.