Andrei Voronkov

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Andrei Voronkov
Andrei Voronkov - Turing 100 - 2012 - Portrait.jpg
Andrei Voronkov at the Alan Turing Centenary Conference, June 24th, 2012
Native name
Андрей Александрович Воронков
Born
Andrei Aleksandrovič Voronkov

(1959-05-14) May 14, 1959 (age 59)[1][2]
Alma materNovosibirsk State University[3]
Known for
Awards
Scientific career
FieldsFormal methods
Institutions
ThesisRealizability and Program Synthesis (1987)
Doctoral students
Website

Andrei Aleksandrovič Voronkov (born 1959)[1][2] is a Professor of Formal methods in the School of Computer Science at the University of Manchester.[20][21][22]

Education[edit]

Voronkov was educated at Novosibirsk State University,[3] graduating with a PhD in 1987.[23][24]

Research[edit]

Voronkov is known for the Vampire[4][25] automated theorem prover, the EasyChair conference management software, the Handbook of Automated Reasoning (with John Alan Robinson, 2001),[26][27][28][29] and as organiser of the Alan Turing Centenary Conference 2012.[30][31][32][33][34]

Voronkov's research has been funded by the Engineering and Physical Sciences Research Council (EPSRC).[35][36]

Awards and honours[edit]

In 2015, his contributions to the field of automated reasoning were recognized with the Herbrand Award.[37] He has won 25 division titles in the CADE ATP System Competition (CASC) at the Conference on Automated Deduction (CADE) since 1999.[citation needed]

References[edit]

  1. ^ a b Andrei Voronkov at Library of Congress Authorities
  2. ^ a b Anon (2016). "Andrei VORONKOV Date of birth May 1959". companieshouse.gov.uk. London: Companies House. Archived from the original on 2016-08-09.
  3. ^ a b c Voronkov, A. A. (1987). "Deductive program synthesis and Markov's principle". Fundamentals of Computation Theory. Lecture Notes in Computer Science. 278. pp. 479–482. doi:10.1007/3-540-18740-5_105. ISBN 978-3-540-18740-0.
  4. ^ a b Voronkov, A. (1995). "The anatomy of vampire". Journal of Automated Reasoning. 15 (2): 237–265. doi:10.1007/BF00881918.
  5. ^ Chubarov, D.; Voronkov, A. (2005). "Solving First-Order Constraints over the Monadic Class". Mechanizing Mathematical Reasoning. Lecture Notes in Computer Science. 2605. p. 132. doi:10.1007/978-3-540-32254-2_8. ISBN 978-3-540-25051-7.
  6. ^ a b c Voronkov, Andrei (2016). "My students". voronkov.com. Manchester. Archived from the original on 2016-06-19.
  7. ^ Hoder, Kryštof (2012). Practical aspects of automated first-order reasoning (PhD thesis). University of Manchester. OCLC 820777408.
  8. ^ Hoder, K. T.; Voronkov, A. (2009). "Comparing Unification Algorithms in First-Order Theorem Proving". KI 2009: Advances in Artificial Intelligence. Lecture Notes in Computer Science. 5803. p. 435. doi:10.1007/978-3-642-04617-9_55. ISBN 978-3-642-04616-2.
  9. ^ Jaber, Mohammed Khazal; Voronkov, Andrei (2006). "Implementation of UNIDOOR, a Deductive Object-Oriented Database System". Advances in Databases and Information Systems. Lecture Notes in Computer Science. 4152. p. 155. doi:10.1007/11827252_14. ISBN 978-3-540-37899-0.
  10. ^ Korovin, Konstantin (2003). Knuth-Bendix Orders in Automated Deduction and Term Rewriting (PhD thesis). University of Manchester. OCLC 813342506.
  11. ^ Korovin, K.; Voronkov, A. (2000). "A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering". Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332). p. 291. doi:10.1109/LICS.2000.855777. ISBN 0-7695-0725-5.
  12. ^ Narasamdya, Iman (2007). Establishing program equivalence in translation validation for optimizing compilers (PhD thesis). University of Manchester. OCLC 852198081.
  13. ^ Voronkov, A.; Narasamdya, I. (2009). "Inter-program Properties". Static Analysis. Lecture Notes in Computer Science. 5673. p. 343. doi:10.1007/978-3-642-03237-0_23. ISBN 978-3-642-03236-3.
  14. ^ Navarro Pérez, Juan Antonio; Voronkov, Andrei (2008). "Proof Systems for Effectively Propositional Logic". Automated Reasoning. Lecture Notes in Computer Science. 5195. p. 426. doi:10.1007/978-3-540-71070-7_36. ISBN 978-3-540-71069-1.
  15. ^ Riazanov, A.; Voronkov, A. (1999). "Vampire". Automated Deduction — CADE-16. Lecture Notes in Computer Science. 1632. p. 292. doi:10.1007/3-540-48660-7_26. ISBN 978-3-540-66222-8.
  16. ^ Fitting, M.; Thalmann, L.; Voronkov, A. (2000). "Term-Modal Logics". Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science. 1847. p. 220. doi:10.1007/10722086_19. ISBN 978-3-540-67697-3.
  17. ^ Tsiskaridze, Nestan (2011). Conflict Resolution (PhD thesis). University of Manchester. OCLC 793676630.
  18. ^ Korovin, K.; Tsiskaridze, N.; Voronkov, A. (2012). "Implementing Conflict Resolution". Perspectives of Systems Informatics. Lecture Notes in Computer Science. 7162. p. 362. doi:10.1007/978-3-642-29709-0_31. ISBN 978-3-642-29708-3.
  19. ^ Degtyarev, A.; Gurevich, Y.; Narendran, P.; Veanes, M.; Voronkov, A. (2000). "Decidability and complexity of simultaneous rigid -unification with one variable and related results". Theoretical Computer Science. 243: 167. doi:10.1016/S0304-3975(98)00185-6.
  20. ^ "Prof Andrei Voronkov, research profile - personal details (The University of Manchester)". Retrieved 2012-06-08.
  21. ^ Dantsin, E.; Eiter, T.; Gottlob, G.; Voronkov, A. (2001). "Complexity and expressive power of logic programming". ACM Computing Surveys. 33 (3): 374. doi:10.1145/502807.502810.
  22. ^ Constantin, A.; Pettifer, S.; Voronkov, A. (2013). "PDFX: fully-automated PDF-to-XML conversion of scientific literature". Proceedings of the 2013 ACM symposium on Document engineering - Doc Eng '13. p. 177. doi:10.1145/2494266.2494271. ISBN 9781450317894.
  23. ^ Voronkov, Andrei (1987). Realizability and Program Synthesis (PhD thesis). Novosibirsk State University.
  24. ^ Voronkov, Andrei (2016). "Papers by Andrei Voronkov". cs.man.ac.uk. University of Manchester. Archived from the original on 2016-03-04.
  25. ^ Kotelnikov, Evgenii; Kovács, Laura; Reger, Giles; Voronkov, Andrei (2016). "The vampire and the FOOL". Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs - CPP 2016. pp. 37–48. doi:10.1145/2854065.2854071. ISBN 9781450341271.
  26. ^ Robinson, John Alan; Voronkov, Andrei, eds. (2001). Handbook of Automated Reasoning. MIT Press + Elsevier. ISBN 9780444508133.
  27. ^ Sekar, R.; Ramakrishnan, I.V.; Voronkov, Andrei (2001). "Term Indexing". In Robinson, John Alan; Voronkov, Andrei. Handbook of Automated Reasoning. pp. 1853–1964. doi:10.1016/B978-044450813-3/50028-X. ISBN 9780444508133.
  28. ^ Degtyarev, Anatoli; Voronkov, Andrei (2001). "Equality Reasoning in Sequent-Based Calculi". In Robinson, John Alan; Voronkov, Andrei. Handbook of Automated Reasoning. pp. 611–706. doi:10.1016/B978-044450813-3/50012-6. ISBN 9780444508133.
  29. ^ Degtyarev, Anatoli; Voronkov, Andrei (2001). "The Inverse Method". In Robinson, John Alan; Voronkov, Andrei. Handbook of Automated Reasoning. pp. 179–272. doi:10.1016/B978-044450813-3/50006-0. ISBN 9780444508133.
  30. ^ List of publications from Microsoft Academic
  31. ^ Andrei Voronkov publications indexed by Google Scholar Edit this at Wikidata
  32. ^ Andrei Voronkov at DBLP Bibliography Server Edit this at Wikidata
  33. ^ Andrei Voronkov's publications indexed by the Scopus bibliographic database. (subscription required)
  34. ^ Andrei Voronkov author profile page at the ACM Digital Library Edit this at Wikidata
  35. ^ Anon (2015). "Grants awarded to Andrei Voronkov by the EPSRC". epsrc.ac.uk. Swindon: Engineering and Physical Sciences Research Council. Archived from the original on 2015-05-12.
  36. ^ Anon (2016). "UK Government grants awarded to Andrei Voronkov". rcuk.ac.uk. Swindon: Research Councils UK. Archived from the original on 2016-08-09.
  37. ^ "Herbrand Award". cadeinc.org. CADE inc.