Search Results for author: Moshe Y. Vardi

Found 19 papers, 10 papers with code

Synthesis from Satisficing and Temporal Goals

1 code implementation20 May 2022 Suguman Bansal, Lydia Kavraki, Moshe Y. Vardi, Andrew Wells

An alternative approach combining LTL synthesis with satisficing DS rewards (rewards that achieve a threshold) is sound and complete for integer discount factors, but, in practice, a fractional discount factor is desired.

reinforcement-learning

DPER: Dynamic Programming for Exist-Random Stochastic SAT

no code implementations19 May 2022 Vu H. N. Phan, Moshe Y. Vardi

Both MAP and ER-SSAT have the form $\operatorname{argmax}_X \sum_Y f(X, Y)$, where $f$ is a real-valued function over disjoint sets $X$ and $Y$ of variables.

Bayesian Inference Fairness

DPO: Dynamic-Programming Optimization on Hybrid Constraints

no code implementations17 May 2022 Vu H. N. Phan, Moshe Y. Vardi

Since a Bayesian network can be encoded as a literal-weighted CNF formula $\varphi$, we study Boolean MPE, a more general problem that requests a model $\tau$ of $\varphi$ with the highest weight, where the weight of $\tau$ is the product of weights of literals satisfied by $\tau$.

Bayesian Inference

DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving

no code implementations8 May 2022 Anastasios Kyrillidis, Moshe Y. Vardi, Zhiwei Zhang

With the power of ADDs and the (graded) project-join-tree builder, our versatile framework can handle many generalizations of MaxSAT, such as MaxSAT with non-CNF constraints, Min-MaxSAT and MinSAT.

On Satisficing in Quantitative Games

1 code implementation6 Jan 2021 Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi

Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games.

On Continuous Local BDD-Based Search for Hybrid SAT Solving

1 code implementation14 Dec 2020 Anastasios Kyrillidis, Moshe Y. Vardi, Zhiwei Zhang

We explore the potential of continuous local search (CLS) in SAT solving by proposing a novel approach for finding a solution of a hybrid system of Boolean constraints.

LTLf Synthesis on Probabilistic Systems

no code implementations23 Sep 2020 Andrew M. Wells, Morteza Lahijanian, Lydia E. Kavraki, Moshe Y. Vardi

Linear Temporal Logic over finite traces (LTLf) has been used to express such properties, but no tools exist to solve policy synthesis for MDP behaviors given finite-trace properties.

DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees

1 code implementation20 Aug 2020 Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi

We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form.

Parallel Weighted Model Counting with Tensor Networks

1 code implementation28 Jun 2020 Jeffrey M. Dudek, Moshe Y. Vardi

In this work, we explore the impact of multi-core and GPU use on tensor-network contraction for weighted model counting.

Data Structures and Algorithms

On the Power of Unambiguity in Büchi Complementation

no code implementations18 May 2020 Yong Li, Moshe Y. Vardi, Lijun Zhang

In this work, we exploit the power of \emph{unambiguity} for the complementation problem of B\"uchi automata by utilizing reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor.

FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints

1 code implementation2 Dec 2019 Anastasios Kyrillidis, Anshumali Shrivastava, Moshe Y. Vardi, Zhiwei Zhang

By such a reduction to continuous optimization, we propose an algebraic framework for solving systems consisting of different types of constraints.

Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications

1 code implementation19 Nov 2019 Suguman Bansal, Yong Li, Lucas M. Tabajara, Moshe Y. Vardi

Our approach utilizes both explicit and symbolic representations of the state-space, and effectively leverages their complementary strengths.

Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions

1 code implementation12 Aug 2019 Jeffrey M. Dudek, Leonardo Dueñas-Osorio, Moshe Y. Vardi

We show that tree decompositions can be used both to find carving decompositions and to factor tensor networks with high-rank, structured tensors.

Tensor Networks

ADDMC: Weighted Model Counting with Algebraic Decision Diagrams

1 code implementation11 Jul 2019 Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi

We present an algorithm to compute exact literal-weighted model counts of Boolean formulas in Conjunctive Normal Form.

On Hashing-Based Approaches to Approximate DNF-Counting

no code implementations14 Oct 2017 Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi

When the constraints are expressed as DNF formulas, Monte Carlo-based techniques have been shown to provide a fully polynomial randomized approximation scheme (FPRAS).

Decision Making Decision Making Under Uncertainty

Symbolic LTLf Synthesis

no code implementations23 May 2017 Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi

LTLf synthesis is the process of finding a strategy that satisfies a linear temporal specification over finite traces.

Approximate Probabilistic Inference via Word-Level Counting

1 code implementation24 Nov 2015 Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi

Techniques based on bit-level (or Boolean) hash functions require these problems to be propositionalized, making it impossible to leverage the remarkable progress made in SMT (Satisfiability Modulo Theory) solvers that can reason directly over words (or bit-vectors).

Distribution-Aware Sampling and Weighted Model Counting for SAT

no code implementations11 Apr 2014 Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi

We present a novel approach that works with a black-box oracle for weights of assignments and requires only an {\NP}-oracle (in practice, a SAT-solver) to solve both the counting and sampling problems.

The Complexity of Integer Bound Propagation

no code implementations16 Jan 2014 Lucas Bordeaux, George Katsirelos, Nina Narodytska, Moshe Y. Vardi

An important question is therefore whether strongly-polynomial algorithms exist that compute the common bound consistent fixpoint of a set of constraints.

Cannot find the paper you are looking for? You can Submit a new open access paper.