The following pages link to Moshe Y. Vardi (Q208771):
Displaying 50 items.
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- Synthesis with rational environments (Q314471) (← links)
- On simplification of schema mappings (Q389226) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Decidable containment of recursive queries (Q555766) (← links)
- Querying logical databases (Q579967) (← links)
- Computing with infinitary logic (Q672337) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Logical query optimization by proof-tree transformation (Q686647) (← links)
- On the complexity of queries in the logical data model (Q688665) (← links)
- Rewriting of regular expressions and regular path queries (Q696951) (← links)
- Bisimulation minimization and symbolic model checking (Q698435) (← links)
- Finite model theory and its applications. (Q703863) (← links)
- Adapting behaviors via reactive synthesis (Q832238) (← links)
- Coverage metrics for temporal logic model checking (Q853721) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- View-based query processing: on the relationship between rewriting, answering and losslessness (Q870266) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- Endmarkers can make a difference (Q911789) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- On the expressive power of Datalog: tools and a case study. (Q960526) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- From liveness to promptness (Q1039845) (← links)
- A note on lossless database decompositions (Q1060867) (← links)
- Formal systems for join dependencies (Q1071524) (← links)
- The implication and finite implication problems for typed template dependencies (Q1071525) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- A note on the reduction of two-way automata to one-way automata (Q1116341) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- (Q1162831) (redirect page) (← links)
- The decision problem for database dependencies (Q1162832) (← links)
- Inferring multivalued dependencies from functional and join dependencies (Q1168088) (← links)
- Armstrong databases for functional and inclusion dependencies (Q1172403) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Common knowledge revisited (Q1295439) (← links)
- Reasoning about infinite computations (Q1341752) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Random 3-SAT: The plot thickens (Q1424763) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Solving parity games: explicit vs symbolic (Q1616970) (← links)
- Comparator automata in quantitative verification (Q1653004) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- The hierarchical approach to modeling knowledge and common knowledge (Q1806329) (← links)
- On the expressive power of data dependencies (Q1822528) (← links)
- Module checking (Q1854407) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- On monadic NP vs monadic co-NP (Q1898480) (← links)
- Pushdown module checking with imperfect information (Q1951589) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
