5 found
  1.  32
    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   10 citations  
  2.  5
    Complexity of Some Problems in Modal and Superintuitionistic Logics.Larisa Maksimova & Andrei Voronkov - 2000 - Bulletin of Symbolic Logic 6:118-119.
  3.  4
    Translating Regular Expression Matching Into Transducers.Yuto Sakuma, Yasuhiko Minamide & Andrei Voronkov - 2012 - Journal of Applied Logic 10 (1):32-51.
  4. Logic for Programming Artificial Intelligence and Reasoning 10th International Conference, Lpar 2003, Almaty, Kazakhstan, September 22-26, 2003 : Proceedings. [REVIEW]Moshe Vardi & Andrei Voronkov - 2003 - Springer Verlag.
    This book constitutes the refereed proceedings of the 10th International Conference on Logic Programming, Artificial Intelligence, and Reasoning, LPAR 2003, held in Almaty, Kazakhstan in September 2003. The 27 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 65 submissions. The papers address all current issues in logic programming, automated reasoning, and AI logics in particular description logics, proof theory, logic calculi, formal verification, model theory, game theory, automata, proof search, constraint systems, model checking, (...)
    Direct download  
    Export citation  
  5. 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