Travelled to:1 × Germany
1 × USA
2 × Canada
Collaborated with:S.Malik D.Tang D.Ranjan Z.Fu
Talks about:satisfi (3) circuit (3) algorithm (2) quantifi (2) problem (2) formula (2) boolean (2) analysi (2) search (2) diamet (2)
Person: Yinlei Yu
DBLP: Yu:Yinlei
Contributed to:
2006
200520042005Wrote 4 papers:
- SAT-2006-YuM #constraints #learning #linear #smt
- Lemma Learning in SMT on Linear Constraints (YY, SM), pp. 142–155.
- DATE-2005-FuYM #satisfiability
- Considering Circuit Observability Don’t Cares in CNF Satisfiability (ZF, YY, SM), pp. 1108–1113.
- SAT-2004-TangYRM #algorithm #analysis #problem #quantifier #satisfiability
- Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
- SAT-J-2004-TangYRM05 #algorithm #analysis #problem #quantifier #satisfiability
- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.