125 citations · 125 across the 3 of their papers we have counts for
3 papers
cs.LO2016
An early sign of satisfiability
Eliezer L. Lozinskii
This note considers checking satisfiability of sets of propositional clauses (SAT instances). It shows that "unipolar sets" of clauses (containing no positive or no negative clause…
cs.AI2011★ 125 cited
The Good Old Davis-Putnam Procedure Helps Counting Models
E. Birnbaum, E. L. Lozinskii
As was shown recently, many important AI problems require counting the number of models of propositional formulas. The problem of counting models of such formulas is, according to…
cs.AI2011
Typical models: minimizing false beliefs
Eliezer L. Lozinskii
A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief der…