Андрей Воронков
- 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
- 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