55 citations · 96 across the 4 of their papers we have counts for
5 papers
Exploiting Isomorphic Subgraphs in SAT (Long version)
Alexander Ivrii, Ofer Strichman
While static symmetry breaking has been explored in the SAT community for decades, only as of 2010 research has focused on exploiting the same discovered symmetry dynamically, duri…
Lagrangian isotopy of tori in and
Georgios Dimitroglou Rizell, Elizabeth Goodman, Alexander Ivrii
We show that, up to Lagrangian isotopy, there is a unique Lagrangian torus inside each of the following uniruled symplectic four-manifolds: the symplectic vector space $\mathbb{R}^…
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty +5
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to con…
The Computational Complexity of Structure-Based Causality
Gadi Aleksandrowicz, Hana Chockler, Joseph Y. Halpern +1
Halpern and Pearl introduced a definition of actual causality; Eiter and Lukasiewicz showed that computing whether X=x is a cause of Y=y is NP-complete in binary models (where all…
Isotopies of high genus Lagrangian surfaces
R. Hind, A. Ivrii
We show that all Lagrangian submanifolds of the cotangent bundle of a Riemann surface which are homotopic to the zero section must be smoothly isotopic to the zero section.