Voronkov, Andrei

1. Knuth-Bendix constraint solving is NP-complete
   2002/07/17 by Konstantin Korovin, Andrei Voronkov, Korovin, Konstantin +2 · 2 citations
   Computer Science · #Constraint Satisfaction and Optimization #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
2. Selecting the Selection
   2016/04/27 by Reger, Giles, Suda, Martin, Voronkov, Andrei +1 · 1 citation
   #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences
3. Coming to Terms with Quantified Reasoning
   2016/11/09 by Laura Kovács, Simon Robillard, Kovacs, Laura +3 · 1 citation
   Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #Software Engineering Research