17 found
Order:
Disambiguations
Moshe Y. Vardi [13]Moshe Vardi [4]
  1.  45
    Reasoning About Knowledge.Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Vardi - 1995 - MIT Press.
    Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...
    Direct download  
     
    Export citation  
     
    Bookmark   318 citations  
  2.  41
    On the Decision Problem for Two-Variable First-Order Logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    We identify the computational complexity of the satisfiability problem for FO 2 , the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO 2 has the finite-model property, which means that if an FO 2 -sentence is satisfiable, then it has a finite (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  3. On Epistemic Logic and Logical Omniscience.William J. Rapaport & Moshe Y. Vardi - 1988 - Journal of Symbolic Logic 53 (2):668.
    Review of Joseph Y. Halpern (ed.), Theoretical Aspects of Reasoning About Knowledge: Proceedings of the 1986 Conference (Los Altos, CA: Morgan Kaufmann, 1986),.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  4.  17
    On the Unusual Effectiveness of Logic in Computer Science.Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi & Victor Vianu - 2001 - Bulletin of Symbolic Logic 7 (2):213-236.
  5.  4
    On The Decision Problem For Two-Variable First-Order Logic, By, Pages 53 -- 69.Erich Gr\"Adel, Phokion Kolaitis & Moshe Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  6. What is an Inference Rule?Ronald Fagin, Joseph Y. Halpern & Moshe Y. Vardi - 1992 - Journal of Symbolic Logic 57 (3):1018-1045.
    What is an inference rule? This question does not have a unique answer. One usually finds two distinct standard answers in the literature; validity inference $(\sigma \vdash_\mathrm{v} \varphi$ if for every substitution $\tau$, the validity of $\tau \lbrack\sigma\rbrack$ entails the validity of $\tau\lbrack\varphi\rbrack)$, and truth inference $(\sigma \vdash_\mathrm{t} \varphi$ if for every substitution $\tau$, the truth of $\tau\lbrack\sigma\rbrack$ entails the truth of $\tau\lbrack\varphi\rbrack)$. In this paper we introduce a general semantic framework that allows us to investigate the notion of inference (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  7.  8
    Common Knowledge Revisited.Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi - 1999 - Annals of Pure and Applied Logic 96 (1-3):89-105.
  8.  21
    Verification of Concurrent Programs: The Automata-Theoretic Framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
    Vardi, M.Y., Verification of concurrent programs: the automata-theoretic framework, Annals of Pure and Applied Logic 51 79–98. We present an automata-theoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P. Now P is correct if and only if a program PA, obtained by combining P and A, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  25
    Reasoning About Knowledge: A Response by the Authors. [REVIEW]Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi - 1997 - Minds and Machines 7 (1):113-113.
  10.  46
    BDD-Based Decision Procedures for the Modal Logic K ★.Guoqiang Pan, Ulrike Sattler & Moshe Y. Vardi - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):169-207.
    We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, we compute certain fixpoints of a set of types — which can be viewed as an on-the-fly emptiness of the automaton. We use BDDs to represent and manipulate such type sets, and investigate different kinds of representations as well as a “level-based” representation scheme. The latter turns out to speed up construction and reduce memory consumption (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  11.  34
    Church's Problem Revisited.Orna Kupferman & Moshe Y. Vardi - 1999 - Bulletin of Symbolic Logic 5 (2):245-263.
    In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  16
    Review: Ronald Fagin, Moshe Y. Vardi, Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report.William J. Rapaport, Ronald Fagin & Moshe Y. Vardi - 1988 - Journal of Symbolic Logic 53 (2):667.
  13.  28
    Special Selection in Logic in Computer Science.Moshe Y. Vardi - 1997 - Journal of Symbolic Logic 62 (2):608.
  14.  17
    Madison, WI, USA March 31–April 3, 2012.Alan Dow, Isaac Goldbring, Warren Goldfarb, Joseph Miller, Toniann Pitassi, Antonio Montalbán, Grigor Sargsyan, Sergei Starchenko & Moshe Vardi - 2013 - Bulletin of Symbolic Logic 19 (2).
  15.  14
    Relating Word and Tree Automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
    In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60s, it was known that deterministic Büchi word automata are less expressive than nondeterministic Büchi word automata. The proof is easy and can be stated in a few lines. In the late 60s, Rabin proved that Büchi tree automata are less expressive than Rabin tree automata. This proof is much harder. In this work we relate the (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  16.  5
    Special Selection in Logic in Computer Science.Moshe Vardi - 1997 - Journal of Symbolic Logic 62 (2):608-608.
    Direct download  
     
    Export citation  
     
    Bookmark  
  17. Logic for Programming Artificial Intelligence and Reasoning 10th International Conference, Lpar 2003, Almaty, Kazakhstan, September 22-26, 2003 : Proceedings. [REVIEW]Moshe Y. Vardi & A. Voronkov - 2003
     
    Export citation  
     
    Bookmark