default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Voronkov
Person information
- affiliation: University of Manchester, UK
- affiliation: Chalmers University of Technology, Sweden
- award (2015): Herbrand Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c150]Laura Kovács
, Petra Hozzová, Márton Hajdú, Andrei Voronkov:
Induction in Saturation. IJCAR (1) 2024: 21-29- [c149]Márton Hajdú, Laura Kovács, Michael Rawson, Andrei Voronkov:
Reducibility Constraints in Superposition. IJCAR (1) 2024: 115-132 - [c148]Petra Hozzová, Daneshvar Amrollahi, Márton Hajdú, Laura Kovács, Andrei Voronkov, Eva Maria Wagner:
Synthesis of Recursive Programs in Saturation. IJCAR (1) 2024: 154-171 - [e50]Nikolaj S. Bjørner, Marijn Heule, Andrei Voronkov:
LPAR 2024 Complementary Volume, Port Louis, Mauritius, May 26-31, 2024. Kalpa Publications in Computing 18, EasyChair 2024 [contents] - [e49]Nikolaj S. Bjørner, Marijn Heule, Andrei Voronkov:
LPAR 2024: Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, Port Louis, Mauritius, May 26-31, 2024. EPiC Series in Computing 100, EasyChair 2024 [contents] - [i14]Márton Hajdú, Petra Hozzová, Laura Kovács, Giles Reger, Andrei Voronkov:
Getting Saturated with Induction. CoRR abs/2402.18954 (2024) - [i13]Petra Hozzová, Laura Kovács, Chase Norman, Andrei Voronkov:
Program Synthesis in Saturation. CoRR abs/2402.18962 (2024) - 2023
- [c147]Petra Hozzová, Laura Kovács, Chase Norman, Andrei Voronkov:
Program Synthesis in Saturation. CADE 2023: 307-324 - [c146]Konstantin Korovin, Laura Kovács, Giles Reger, Johannes Schoisswohl, Andrei Voronkov:
ALASCA: Reasoning in Quantified Linear Arithmetic. TACAS (1) 2023: 647-665 - [e48]Ruzica Piskac, Andrei Voronkov:
LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Manizales, Colombia, 4-9th June 2023. EPiC Series in Computing 94, EasyChair 2023 [contents] - 2022
- [c145]Márton Hajdú, Petra Hozzová, Laura Kovács, Giles Reger, Andrei Voronkov:
Getting Saturated with Induction. Principles of Systems Design 2022: 306-322 - [c144]Márton Hajdú, Laura Kovács, Michael Rawson, Andrei Voronkov:
The Vampire Approach to Induction (short paper). PAAR@IJCAR 2022 - 2021
- [c143]Petra Hozzová, Laura Kovács, Andrei Voronkov:
Integer Induction in Saturation. CADE 2021: 361-377 - [c142]Márton Hajdú, Petra Hozzová, Laura Kovács, Andrei Voronkov:
Induction with Recursive Definitions in Superposition. FMCAD 2021: 1-10 - [c141]Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov:
Inductive Benchmarks for Automated Reasoning. CICM 2021: 124-129 - [c140]Giles Reger, Johannes Schoisswohl, Andrei Voronkov:
Making Theory Reasoning Simpler. TACAS (2) 2021: 164-180 - 2020
- [c139]Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov:
Induction with Generalization in Superposition Reasoning. CICM 2020: 123-137
2010 – 2019
- 2019
- [c138]Giles Reger, Andrei Voronkov:
Induction in Saturation-Based Proof Search. CADE 2019: 477-494 - [e47]Nikolaj S. Bjørner, Irina B. Virbitskaite, Andrei Voronkov:
Perspectives of System Informatics - 12th International Andrei P. Ershov Informatics Conference, PSI 2019, Novosibirsk, Russia, July 2-5, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11964, Springer 2019, ISBN 978-3-030-37486-0 [contents] - [e46]Laura Kovács, Andrei Voronkov:
Vampire 2018 and Vampire 2019. The 5th and 6th Vampire Workshops. EPiC Series in Computing 71, EasyChair 2019 [contents] - 2018
- [c137]Evgenii Kotelnikov, Laura Kovács, Andrei Voronkov:
A FOOLish Encoding of the Next State Relations of Imperative Programs. IJCAR 2018: 405-421 - [c136]Andrei Voronkov:
Reasoning with Quantifiers and Theories Using Saturation-Based Reasoning. SYNASC 2018: 18 - [c135]Giles Reger, Martin Suda, Andrei Voronkov:
Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning. TACAS (1) 2018: 3-22 - [e45]Alexander K. Petrenko, Andrei Voronkov:
Perspectives of System Informatics - 11th International Andrei P. Ershov Informatics Conference, PSI 2017, Moscow, Russia, June 27-29, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10742, Springer 2018, ISBN 978-3-319-74312-7 [contents] - 2017
- [c134]Laura Kovács, Andrei Voronkov:
First-Order Interpolation and Interpolating Proof Systems. LPAR 2017: 49-64 - [c133]Laura Kovács, Simon Robillard, Andrei Voronkov:
Coming to terms with quantified reasoning. POPL 2017: 260-270 - [c132]Giles Reger, Martin Suda, Andrei Voronkov:
Instantiation and Pretending to be an SMT Solver with Vampire. SMT 2017: 63-75 - [c131]Giles Reger, Martin Suda, Andrei Voronkov:
Testing a Saturation-Based Theorem Prover: Experiences and Challenges. TAP@STAF 2017: 152-161 - [e44]Laura Kovács, Andrei Voronkov:
Vampire@IJCAR 2016. Proceedings of the 3rd Vampire Workshop, Coimbra, Portugal, July 2, 2016. EPiC Series in Computing 44, EasyChair 2017 [contents] - [e43]Thomas Eiter, David Sands, Geoff Sutcliffe, Andrei Voronkov:
IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017. Kalpa Publications in Computing 1, EasyChair 2017 [contents] - [i12]Giles Reger, Martin Suda, Andrei Voronkov:
Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Extended Version). CoRR abs/1704.03391 (2017) - 2016
- [c130]Krystof Hoder, Giles Reger, Martin Suda, Andrei Voronkov:
Selecting the Selection. IJCAR 2016: 313-329 - [c129]Evgenii Kotelnikov, Laura Kovács, Giles Reger, Andrei Voronkov:
The vampire and the FOOL. CPP 2016: 37-48 - [c128]Giles Reger, Martin Suda, Andrei Voronkov:
New Techniques in Clausal Form Generation. GCAI 2016: 11-23 - [c127]Giles Reger, Nikolaj S. Bjørner, Martin Suda, Andrei Voronkov:
AVATAR Modulo Theories. GCAI 2016: 39-52 - [c126]Evgenii Kotelnikov, Laura Kovács, Martin Suda, Andrei Voronkov:
A Clausal Normal Form Translation for FOOL. GCAI 2016: 53-71 - [c125]Giles Reger, Martin Suda, Andrei Voronkov:
Finding Finite Models in Multi-sorted First-Order Logic. SAT 2016: 323-341 - [e42]Laura Kovács, Andrei Voronkov:
Proceedings of the 1st and 2nd Vampire Workshops, Vampire@VSL 2014, Vienna, Austria, July 23, 2014 / Vampire@CADE 2015, Berlin, Germany, August 2, 2015. EPiC Series in Computing 38, EasyChair 2016 [contents] - [e41]Manuel Mazzara, Andrei Voronkov:
Perspectives of System Informatics - 10th International Andrei Ershov Informatics Conference, PSI 2015, in Memory of Helmut Veith, Kazan and Innopolis, Russia, August 24-27, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9609, Springer 2016, ISBN 978-3-319-41578-9 [contents] - [i11]Giles Reger, Martin Suda, Andrei Voronkov:
Finding Finite Models in Multi-Sorted First Order Logic. CoRR abs/1604.08040 (2016) - [i10]Giles Reger, Martin Suda, Andrei Voronkov, Krystof Hoder:
Selecting the Selection. CoRR abs/1604.08055 (2016) - [i9]Laura Kovács, Simon Robillard, Andrei Voronkov:
Coming to Terms with Quantified Reasoning. CoRR abs/1611.02908 (2016) - 2015
- [c124]Giles Reger, Dmitry Tishkovsky, Andrei Voronkov:
Cooperating Proof Attempts. CADE 2015: 339-355 - [c123]Giles Reger, Martin Suda, Andrei Voronkov:
Playing with AVATAR. CADE 2015: 399-415 - [c122]Evgenii Kotelnikov, Laura Kovács, Andrei Voronkov:
A First Class Boolean Sort in First-Order Theorem Proving and TPTP. CICM 2015: 71-86 - [e40]Andrei Voronkov, Irina B. Virbitskaite:
Perspectives of System Informatics - 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8974, Springer 2015, ISBN 978-3-662-46822-7 [contents] - [e39]Georg Gottlob, Geoff Sutcliffe, Andrei Voronkov:
Global Conference on Artificial Intelligence, GCAI 2015, Tbilisi, Georgia, October 16-19, 2015. EPiC Series in Computing 36, EasyChair 2015 [contents] - [e38]Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe, Andrei Voronkov:
20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations, LPAR 2015, Suva, Fiji, November 24-28, 2015. EPiC Series in Computing 35, EasyChair 2015 [contents] - [e37]Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings. Lecture Notes in Computer Science 9450, Springer 2015, ISBN 978-3-662-48898-0 [contents] - [i8]Evgenii Kotelnikov, Laura Kovács, Andrei Voronkov:
A First Class Boolean Sort in First-Order Theorem Proving and TPTP. CoRR abs/1505.01682 (2015) - [i7]Evgenii Kotelnikov, Laura Kovács, Giles Reger, Andrei Voronkov:
The Vampire and the FOOL. CoRR abs/1510.04821 (2015) - 2014
- [c121]Ashutosh Gupta, Laura Kovács, Bernhard Kragl, Andrei Voronkov:
Extensional Crisis and Proving Identity. ATVA 2014: 185-200 - [c120]Armin Biere, Ioan Dragan, Laura Kovács, Andrei Voronkov:
SAT solving experiments in Vampire. Vampire Workshop 2014: 29-32 - [c119]Giles Reger, Martin Suda, Andrei Voronkov:
The Challenges of Evaluating a New Feature in Vampire. Vampire Workshop 2014: 70-74 - [c118]Andrei Voronkov:
AVATAR: The Architecture for First-Order Theorem Provers. CAV 2014: 696-710 - [c117]Andrei Voronkov:
Keynote talk: EasyChair. ASE 2014: 3-4 - [c116]Armin Biere, Ioan Dragan, Laura Kovács, Andrei Voronkov:
Experimenting with SAT Solvers in Vampire. MICAI (1) 2014: 431-442 - [e36]Andrei Voronkov, Margarita V. Korovina:
HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday. EPiC Series in Computing 42, EasyChair 2014 [contents] - [e35]Irina B. Virbitskaite, Andrei Voronkov:
PSI 2014. Ershov Informatics Conference, June 24-27, 2014, Peterhof, St. Petersburg, Russia, Poster Presentations. EPiC Series in Computing 23, EasyChair 2014 [contents] - [e34]Kenneth L. McMillan, Aart Middeldorp, Geoff Sutcliffe, Andrei Voronkov:
LPAR 2013, 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, December 12-17, 2013, Stellenbosch, South Africa, Short papers proceedings. EPiC Series in Computing 26, EasyChair 2014 [contents] - [e33]Temur Kutsia, Andrei Voronkov:
6th International Symposium on Symbolic Computation in Software Science, SCSS 2014, Gammarth, La Marsa, Tunisia, December 7-8, 2014. EPiC Series in Computing 30, EasyChair 2014 [contents] - 2013
- [c115]Deepak Kapur, Robert Nieuwenhuis, Andrei Voronkov, Christoph Weidenbach, Reinhard Wilhelm:
Harald Ganzinger's Legacy: Contributions to Logics and Programming. Programming Logics 2013: 1-18 - [c114]Juan Antonio Navarro Pérez, Andrei Voronkov:
Planning with Effectively Propositional Logic. Programming Logics 2013: 302-316 - [c113]Krystof Hoder, Andrei Voronkov:
The 481 Ways to Split a Clause and Deal with Propositional Variables. CADE 2013: 450-464 - [c112]Laura Kovács, Andrei Voronkov:
First-Order Theorem Proving and Vampire. CAV 2013: 1-35 - [c111]Alexandru Constantin, Steve Pettifer, Andrei Voronkov:
PDFX: fully-automated PDF-to-XML conversion of scientific literature. ACM Symposium on Document Engineering 2013: 177-180 - [c110]Laura Kovács, Andrei Mantsivoda, Andrei Voronkov:
The Inverse Method for Many-Valued Logics. MICAI (1) 2013: 12-23 - [c109]Ioan Dragan, Konstantin Korovin, Laura Kovács, Andrei Voronkov:
Bound Propagation for Arithmetic Reasoning in Vampire. SYNASC 2013: 169-176 - [e32]Andrei Voronkov, Christoph Weidenbach:
Programming Logics - Essays in Memory of Harald Ganzinger. Lecture Notes in Computer Science 7797, Springer 2013, ISBN 978-3-642-37650-4 [contents] - [e31]Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz, Christian G. Fermüller:
Short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning, LPAR-17-short, Yogyakarta, Indonesia, October 10-15, 2010. EPiC Series in Computing 13, EasyChair 2013 [contents] - [e30]Kenneth L. McMillan, Aart Middeldorp, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings. Lecture Notes in Computer Science 8312, Springer 2013, ISBN 978-3-642-45220-8 [contents] - 2012
- [j23]Yuto Sakuma, Yasuhiko Minamide, Andrei Voronkov:
Translating regular expression matching into transducers. J. Appl. Log. 10(1): 32-51 (2012) - [c108]Krystof Hoder, Andreas Holzer, Laura Kovács, Andrei Voronkov:
Vinter: A Vampire-Based Tool for Interpolation. APLAS 2012: 148-156 - [c107]Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Christoph Sticksel, Andrei Voronkov:
EPR-Based Bounded Model Checking at Word Level. IJCAR 2012: 210-224 - [c106]Krystof Hoder, Zurab Khasidashvili, Konstantin Korovin, Andrei Voronkov:
Preprocessing techniques for first-order clausification. FMCAD 2012: 44-51 - [c105]Krystof Hoder, Laura Kovács, Andrei Voronkov:
Playing in the grey area of proofs. POPL 2012: 259-272 - [e29]Andrei Voronkov:
Turing-100 - The Alan Turing Centenary, Manchester, UK, June 22-25, 2012. EPiC Series in Computing 10, EasyChair 2012 [contents] - [e28]Andrei Voronkov, Laura Kovács, Nikolaj S. Bjørner:
Second International Workshop on Invariant Generation, WING 2009, York, UK, March 29, 2009 and Third International Workshop on Invariant Generation, WING 2010, Edinburgh, UK, July 21, 2010. EPiC Series in Computing 1, EasyChair 2012 [contents] - [e27]Edmund M. Clarke, Irina B. Virbitskaite, Andrei Voronkov:
Perspectives of Systems Informatics - 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7162, Springer 2012, ISBN 978-3-642-29708-3 [contents] - [e26]Nikolaj S. Bjørner, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, Mérida, Venezuela, March 11-15, 2012. Proceedings. Lecture Notes in Computer Science 7180, Springer 2012, ISBN 978-3-642-28716-9 [contents] - [e25]Andrei Voronkov, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, Timisoara, Romania, September 26-29, 2012. IEEE Computer Society 2012, ISBN 978-1-4673-5026-6 [contents] - 2011
- [c104]Krystof Hoder, Andrei Voronkov:
Sine Qua Non for Large Theory Reasoning. CADE 2011: 299-314 - [c103]Konstantin Korovin, Andrei Voronkov:
Solving Systems of Linear Inequalities by Bound Propagation. CADE 2011: 369-383 - [c102]Laura Kovács, Georg Moser, Andrei Voronkov:
On Transfinite Knuth-Bendix Orders. CADE 2011: 384-399 - [c101]Konstantin Korovin, Andrei Voronkov:
GoRRiLA and Hard Reality. Ershov Memorial Conference 2011: 243-250 - [c100]Konstantin Korovin, Nestan Tsiskaridze, Andrei Voronkov:
Implementing Conflict Resolution. Ershov Memorial Conference 2011: 362-376 - [c99]Krystof Hoder, Laura Kovács, Andrei Voronkov:
Case Studies on Invariant Generation Using a Saturation Theorem Prover. MICAI (1) 2011: 1-15 - [c98]Krystof Hoder, Laura Kovács, Andrei Voronkov:
Invariant Generation in Vampire. TACAS 2011: 60-64 - [i6]Nikolaj S. Bjørner, Robert Nieuwenhuis, Helmut Veith, Andrei Voronkov:
Decision Procedures in Soft, Hard and Bio-ware - Follow Up (Dagstuhl Seminar 11272). Dagstuhl Reports 1(7): 23-35 (2011) - 2010
- [c97]Krystof Hoder, Laura Kovács, Andrei Voronkov:
Interpolation and Symbol Elimination in Vampire. IJCAR 2010: 188-195 - [c96]Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Andrei Voronkov:
Encoding industrial hardware verification problems into effectively propositional logic. FMCAD 2010: 137-144 - [c95]Josef Urban, Krystof Hoder, Andrei Voronkov:
Evaluation of Automated Theorem Proving on the Mizar Mathematical Library. ICMS 2010: 155-166 - [c94]Yasuhiko Minamide, Yuto Sakuma, Andrei Voronkov:
Translating Regular Expression Matching into Transducers. SYNASC 2010: 107-115 - [c93]Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács, Andrei Voronkov:
Invariant and Type Inference for Matrices. VMCAI 2010: 163-179 - [c92]Andrei Voronkov:
EasyChair. WWV 2010: 2 - [e24]Nikolaj S. Bjørner, Robert Nieuwenhuis, Helmut Veith, Andrei Voronkov:
Decision Procedures in Software, Hardware and Bioware, 18.04. - 23.04.2010. Dagstuhl Seminar Proceedings 10161, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [e23]Amir Pnueli, Irina B. Virbitskaite, Andrei Voronkov:
Perspectives of Systems Informatics, 7th International Andrei Ershov Memorial Conference, PSI 2009, Novosibirsk, Russia, June 15-19, 2009. Revised Papers. Lecture Notes in Computer Science 5947, Springer 2010, ISBN 978-3-642-11485-4 [contents] - [e22]Edmund M. Clarke, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6355, Springer 2010, ISBN 978-3-642-17510-7 [contents] - [e21]Christian G. Fermüller, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings. Lecture Notes in Computer Science 6397, Springer 2010, ISBN 978-3-642-16241-1 [contents] - [i5]Nikolaj S. Bjørner, Robert Nieuwenhuis, Helmut Veith, Andrei Voronkov:
10161 Abstracts Collection - Decision Procedures in Software, Hardware and Bioware. Decision Procedures in Software, Hardware and Bioware 2010 - [i4]Nikolaj S. Bjørner, Robert Nieuwenhuis, Helmut Veith, Andrei Voronkov:
10161 Executive Summary - Decision Procedures in Software, Hardware and Bioware. Decision Procedures in Software, Hardware and Bioware 2010
2000 – 2009
- 2009
- [c91]Laura Kovács, Andrei Voronkov:
Interpolation and Symbol Elimination. CADE 2009: 199-213 - [c90]Konstantin Korovin, Nestan Tsiskaridze, Andrei Voronkov:
Conflict Resolution. CP 2009: 509-523 - [c89]Laura Kovács, Andrei Voronkov:
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. FASE 2009: 470-485 - [c88]Zurab Khasidashvili, Mahmoud Kinanah, Andrei Voronkov:
Verifying equivalence of memories using a first order logic theorem prover. FMCAD 2009: 128-135 - [c87]Krystof Hoder, Andrei Voronkov:
Comparing Unification Algorithms in First-Order Theorem Proving. KI 2009: 435-443 - [c86]Andrei Voronkov, Iman Narasamdya:
Inter-program Properties. SAS 2009: 343-359 - [c85]Laura Kovács, Andrei Voronkov:
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. SYNASC 2009: 10 - [c84]Andrei Voronkov:
Satisfiability and Theories. SYNASC 2009: 16 - [c83]Nikolaj S. Bjørner, Nikolai Tillmann, Andrei Voronkov:
Path Feasibility Analysis for String-Manipulating Programs. TACAS 2009: 307-321 - 2008
- [c82]Juan Antonio Navarro Pérez, Andrei Voronkov:
Proof Systems for Effectively Propositional Logic. IJCAR 2008: 426-440 - [e20]Iliano Cervesato, Helmut Veith, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Lecture Notes in Computer Science 5330, Springer 2008, ISBN 978-3-540-89438-4 [contents] - [e19]Andrei Voronkov:
Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings. Lecture Notes in Computer Science 5117, Springer 2008, ISBN 978-3-540-70588-8 [contents] - 2007
- [c81]Juan Antonio Navarro Pérez, Andrei Voronkov:
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic. CADE 2007: 346-361 - [c80]Konstantin Korovin, Andrei Voronkov:
Integrating Linear Arithmetic into Superposition Calculus. CSL 2007: 223-237 - [c79]Juan Antonio Navarro Pérez, Andrei Voronkov:
Encodings of Problems in Effectively Propositional Logic. SAT 2007: 3 - [e18]Volker Diekert, Mikhail V. Volkov, Andrei Voronkov:
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Lecture Notes in Computer Science 4649, Springer 2007, ISBN 978-3-540-74509-9 [contents] - [e17]Irina B. Virbitskaite, Andrei Voronkov:
Perspectives of Systems Informatics, 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia, June 27-30, 2006. Revised Papers. Lecture Notes in Computer Science 4378, Springer 2007, ISBN 978-3-540-70880-3 [contents] - [e16]Nachum Dershowitz, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings. Lecture Notes in Computer Science 4790, Springer 2007, ISBN 978-3-540-75558-6 [contents] - 2006
- [c78]Mohammed K. Jaber, Andrei Voronkov:
Implementation of UNIDOOR, a Deductive Object-Oriented Database System. ADBIS 2006: 155-170 - [c77]Ian Horrocks, Andrei Voronkov:
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover. FoIKS 2006: 201-218 - [c76]Mohammed K. Jaber, Andrei Voronkov:
UNIDOOR: a Deductive Object-Oriented Database Management System. ICDE 2006: 157 - [c75]Andrei Voronkov:
Inconsistencies in Ontologies. JELIA 2006: 19 - [e15]Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov:
Deduction and Applications, 23.-28. October 2005. Dagstuhl Seminar Proceedings 05431, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e14]Miki Hermann, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings. Lecture Notes in Computer Science 4246, Springer 2006, ISBN 3-540-48281-4 [contents] - 2005
- [j22]Alexandre Riazanov, Andrei Voronkov:
Efficient instance retrieval with standard and relational path indexing. Inf. Comput. 199(1-2): 228-252 (2005) - [j21]Konstantin Korovin, Andrei Voronkov:
Knuth-Bendix constraint solving is NP-complete. ACM Trans. Comput. Log. 6(2): 361-388 (2005) - [c74]Juan Antonio Navarro Pérez, Andrei Voronkov:
Generation of Hard Non-Clausal Random Satisfiability Problems. AAAI 2005: 436-442 - [c73]Dimitri Chubarov, Andrei Voronkov:
Solving First-Order Constraints over the Monadic Class. Mechanizing Mathematical Reasoning 2005: 132-138 - [c72]Dimitri Chubarov, Andrei Voronkov:
Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications. MFCS 2005: 260-270 - [c71]Konstantin Korovin, Andrei Voronkov:
Random Databases and Threshold for Monotone Non-recursive Datalog. MFCS 2005: 591-602 - [c70]Iman Narasamdya, Andrei Voronkov:
Finding Basic Block and Variable Correspondence. SAS 2005: 251-267 - [e13]Franz Baader, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings. Lecture Notes in Computer Science 3452, Springer 2005, ISBN 3-540-25236-3 [contents] - [e12]Geoff Sutcliffe, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings. Lecture Notes in Computer Science 3835, Springer 2005, ISBN 3-540-30553-X [contents] - [i3]Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov:
05431 Executive Summary - Deduction and Applications. Deduction and Applications 2005 - [i2]Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov:
05431 Abstracts Collection - Deduction and Applications. Deduction and Applications 2005 - 2004
- [c69]Alexandre Riazanov, Andrei Voronkov:
Efficient Checking of Term Ordering Constraints. IJCAR 2004: 60-74 - [c68]Ullrich Hustadt, Boris Konev, Alexandre Riazanov, Andrei Voronkov:
TeMP: A Temporal Monodic Prover. IJCAR 2004: 326-330 - 2003
- [j20]Konstantin Korovin, Andrei Voronkov:
Orienting rewrite rules with the Knuth-Bendix order. Inf. Comput. 183(2): 165-186 (2003) - [j19]Andrei Voronkov:
Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification. J. Autom. Reason. 30(2): 121-151 (2003) - [j18]Anatoli Degtyarev, Robert Nieuwenhuis, Andrei Voronkov:
Stratified resolution. J. Symb. Comput. 36(1-2): 79-99 (2003) - [j17]Alexandre Riazanov, Andrei Voronkov:
Limited resource strategy in resolution theorem proving. J. Symb. Comput. 36(1-2): 101-115 (2003) - [c67]Konstantin Korovin, Andrei Voronkov:
An AC-Compatible Knuth-Bendix Order. CADE 2003: 47-59 - [c66]Alexandre Riazanov, Andrei Voronkov:
Efficient Instance Retrieval with Standard and Relational Path Indexing. CADE 2003: 380-396 - [c65]Larisa Maksimova, Andrei Voronkov:
Complexity of Some Problems in Modal and Intuitionistic Calculi. CSL 2003: 397-412 - [c64]Tatiana Rybina, Andrei Voronkov:
Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture). CSL 2003: 546-573 - [c63]Tatiana Rybina, Andrei Voronkov:
A Logical Reconstruction of Reachability. Ershov Memorial Conference 2003: 222-237 - [c62]Tatiana Rybina, Andrei Voronkov:
Upper Bounds for a Theory of Queues. ICALP 2003: 714-724 - [c61]Andrei Voronkov:
Automated Reasoning: Past Story and New Trends. IJCAI 2003: 1607-1612 - [c60]Konstantin Korovin, Andrei Voronkov:
Orienting Equalities with the Knuth-Bendix Order. LICS 2003: 75- - [e11]Moshe Y. Vardi, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings. Lecture Notes in Computer Science 2850, Springer 2003, ISBN 3-540-20101-7 [contents] - 2002
- [j16]Alexandre Riazanov, Andrei Voronkov:
The design and implementation of VAMPIRE. AI Commun. 15(2-3): 91-110 (2002) - [c59]Tatiana Rybina, Andrei Voronkov:
BRAIN : Backward Reachability Analysis with Integers. AMAST 2002: 489-494 - [c58]Tatiana Rybina, Andrei Voronkov:
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking. CAV 2002: 386-400 - [c57]Andrei Voronkov:
First-Order Theorem Provers: the Next Generation. Description Logics 2002 - [c56]Konstantin Korovin, Andrei Voronkov:
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures. FSTTCS 2002: 230-240 - [e10]Andrei Voronkov:
Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings. Lecture Notes in Computer Science 2392, Springer 2002, ISBN 3-540-43931-5 [contents] - [e9]Matthias Baaz, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings. Lecture Notes in Computer Science 2514, Springer 2002, ISBN 3-540-00010-0 [contents] - [i1]Konstantin Korovin, Andrei Voronkov:
Knuth-Bendix constraint solving is NP-complete. CoRR cs.LO/0207068 (2002) - 2001
- [j15]Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov:
Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3): 374-425 (2001) - [j14]Melvin Fitting, Lars Thalmann, Andrei Voronkov:
Term-Modal Logics. Stud Logica 69(1): 133-169 (2001) - [j13]Tatiana Rybina, Andrei Voronkov:
A decision procedure for term algebras with queues. ACM Trans. Comput. Log. 2(2): 155-181 (2001) - [j12]Andrei Voronkov:
How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi. ACM Trans. Comput. Log. 2(2): 182-215 (2001) - [c55]Andrei Voronkov:
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction. IJCAR 2001: 13-28 - [c54]Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, Andrei Voronkov:
On the Evaluation of Indexing Techniques for Theorem Proving. IJCAR 2001: 257-271 - [c53]Alexandre Riazanov, Andrei Voronkov:
Vampire 1.1 (System Description). IJCAR 2001: 376-380 - [c52]Alexandre Riazanov, Andrei Voronkov:
Adaptive Saturation-Based Reasoning. Ershov Memorial Conference 2001: 95-108 - [c51]Konstantin Korovin, Andrei Voronkov:
Knuth-Bendix Constraint Solving Is NP-Complete. ICALP 2001: 979-992 - [c50]Alexandre Riazanov, Andrei Voronkov:
Splitting Without Backtracking. IJCAI 2001: 611-617 - [c49]Konstantin Korovin, Andrei Voronkov:
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order. RTA 2001: 137-153 - [p5]Anatoli Degtyarev, Andrei Voronkov:
The Inverse Method. Handbook of Automated Reasoning 2001: 179-272 - [p4]Anatoli Degtyarev, Andrei Voronkov:
Equality Reasoning in Sequent-Based Calculi. Handbook of Automated Reasoning 2001: 611-706 - [p3]I. V. Ramakrishnan, R. Sekar, Andrei Voronkov:
Term Indexing. Handbook of Automated Reasoning 2001: 1853-1964 - [p2]John Alan Robinson, Andrei Voronkov:
Preface. Handbook of Automated Reasoning 2001: v-vii - [p1]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov:
Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Current Trends in Theoretical Computer Science 2001: 303-326 - [e8]John Alan Robinson, Andrei Voronkov:
Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press 2001, ISBN 0-444-50813-9 [contents] - [e7]Robert Nieuwenhuis, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings. Lecture Notes in Computer Science 2250, Springer 2001, ISBN 3-540-42957-3 [contents] - 2000
- [j11]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243(1-2): 167-184 (2000) - [c48]Konstantin Korovin, Andrei Voronkov:
The Existential Theories of Term Algebras with the Knuth-Bendix Orderings are Decidable. ARW 2000 - [c47]Alexandre Riazanov, Andrei Voronkov:
System Description: Vampire 1.0. ARW 2000 - [c46]Tatiana Rybina, Andrei Voronkov:
A Decision Procedure for Term Algebras with Queues. ARW 2000 - [c45]Anatoli Degtyarev, Andrei Voronkov:
Stratified Resolution. CADE 2000: 365-384 - [c44]Alexandre Riazanov, Andrei Voronkov:
Partially Adaptive Code Trees. JELIA 2000: 209-223 - [c43]Andrei Voronkov:
Deciding K using inverse-K. KR 2000: 198-209 - [c42]Tatiana Rybina, Andrei Voronkov:
A Decision Procedure for Term Algebras with Queues. LICS 2000: 279-290 - [c41]Konstantin Korovin, Andrei Voronkov:
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering. LICS 2000: 291-302 - [c40]Andrei Voronkov:
How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi. LICS 2000: 401-412 - [c39]Evgeny Dantsin, Andrei Voronkov:
Expressive Power and Data Complexity of Query Languages for Trees and Lists. PODS 2000: 157-165 - [c38]Melvin Fitting, Lars Thalmann, Andrei Voronkov:
Term-Modal Logics. TABLEAUX 2000: 220-236 - [e6]Michel Parigot, Andrei Voronkov:
Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, Proceedings. Lecture Notes in Computer Science 1955, Springer 2000 [contents]
1990 – 1999
- 1999
- [j10]Andrei Voronkov:
The Ground-Negative Fragment of First-Order Logic Is Pip2-Complete. J. Symb. Log. 64(3): 984-990 (1999) - [j9]Yuri Gurevich, Andrei Voronkov:
Monadic Simultaneous Rigid E-unification. Theor. Comput. Sci. 222(1-2): 133-152 (1999) - [j8]Andrei Voronkov:
Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem. Theor. Comput. Sci. 224(1-2): 319-352 (1999) - [c37]Alexandre Riazanov, Andrei Voronkov:
Vampire. CADE 1999: 292-296 - [c36]Andrei Voronkov:
KK: a theorem prover for K. CADE 1999: 383-387 - [c35]Evgeny Dantsin, Andrei Voronkov:
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. FoSSaCS 1999: 180-196 - [e5]Harald Ganzinger, David A. McAllester, Andrei Voronkov:
Logic Programming and Automated Reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings. Lecture Notes in Computer Science 1705, Springer 1999, ISBN 3-540-66492-0 [contents] - 1998
- [j7]Anatoli Degtyarev, Andrei Voronkov:
What You Always Wanted to Know about Rigid E-Unification. J. Autom. Reason. 20(1): 47-80 (1998) - [j6]Andrei Voronkov:
Proof Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification. J. Autom. Reason. 21(2): 205-231 (1998) - [c34]Leo Bachmair, Harald Ganzinger, Andrei Voronkov:
Elimination of Equality via Transformation with Ordering Constraints. CADE 1998: 175-190 - [c33]Andrei Voronkov:
Herbrand's Theorem, Automated Reasoning and Semantics Tableaux. LICS 1998: 252-263 - [c32]Sergei G. Vorobyov, Andrei Voronkov:
Complexity of Nonrecursive Logic Programs with Complex Values. PODS 1998: 244-253 - [c31]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195 - [e4]Burkhard Freitag, Hendrik Decker, Michael Kifer, Andrei Voronkov:
Transactions and Change in Logic Databases, International Seminar on Logic Databases and the Meaning of Change, Schloss Dagstuhl, Germany, September 23-27, 1996 and ILPS '97 Post-Conference Workshop on (Trans)Actions and Change in Logic Programming and Deductive Databases, (DYNAMICS'97) Port Jefferson, NY, USA, October 17, 1997, Invited Surveys and Selected Papers. Lecture Notes in Computer Science 1472, Springer 1998, ISBN 3-540-65305-8 [contents] - 1997
- [c30]Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov:
Complexity and Expressive Power of Logic Programming. CCC 1997: 82-101 - [c29]Yuri Gurevich, Andrei Voronkov:
Monadic Simultaneous Rigid E-Unification and Related Problems. ICALP 1997: 154-165 - [c28]Andrei Voronkov:
Strategies in Rigid-Variable Methods. IJCAI (1) 1997: 114-121 - [c27]Evgeny Dantsin, Andrei Voronkov:
Complexity of Query Answering in Logic Databases with Complex Values. LFCS 1997: 56-66 - 1996
- [j5]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov:
Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bull. EATCS 60: 78-96 (1996) - [j4]Anatoli Degtyarev, Andrei Voronkov:
A Note on Semantics of Logic Programs with Equality Based on Complete Sets of E-Unifiers. J. Log. Program. 28(3): 207-216 (1996) - [j3]Anatoli Degtyarev, Andrei Voronkov:
The Undecidability of Simultaneous Rigid E-Unification. Theor. Comput. Sci. 166(1&2): 291-300 (1996) - [c26]Andrei Voronkov:
Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification. CADE 1996: 32-46 - [c25]Anatoli Degtyarev, Andrei Voronkov:
Equality Elimination for the Tableau Method. DISCO 1996: 46-60 - [c24]Martin Argenius, Andrei Voronkov:
Semantics of Constraint Logic Programs with Bounded Quantifiers. ELP 1996: 1-18 - [c23]Anatoli Degtyarev, Andrei Voronkov:
Handling Equality in Logic Programming via Basic Folding. ELP 1996: 119-136 - [c22]Andrei Voronkov:
Merging Relational Database Technology with Constraint Technology. Ershov Memorial Conference 1996: 409-419 - [c21]Anatoli Degtyarev, Andrei Voronkov:
What You Always Wanted to Know About Rigid E-Unification. JELIA 1996: 50-69 - [c20]Anatoli Degtyarev, Yuri V. Matiyasevich, Andrei Voronkov:
Simultaneous E-Unification and Related Algorithmic Problems. LICS 1996: 494-502 - [c19]Anatoli Degtyarev, Andrei Voronkov:
Decidability Problems for the Prenex Fragment of Intuitionistic Logic. LICS 1996: 503-512 - [c18]Andrei Voronkov:
Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction. TABLEAUX 1996: 312-329 - 1995
- [j2]Andrei Voronkov:
On Computability by Logic Programs. Ann. Math. Artif. Intell. 15(3-4): 437-456 (1995) - [j1]Andrei Voronkov:
The Anatomy of Vampire Implementing Bottom-up Procedures with Code Trees. J. Autom. Reason. 15(2): 237-265 (1995) - [c17]Anatoli Degtyarev, Andrei Voronkov:
Simultaneous Regid E-Unification Is Undecidable. CSL 1995: 178-190 - [c16]Anatoli Degtyarev, Andrei Voronkov:
A New Procedural Interpretation of Horn Clauses with Equality. ICLP 1995: 565-579 - [c15]Anatoli Degtyarev, Andrei Voronkov:
Equality Elimination for the Inverse Method and Extension Procedures. IJCAI 1995: 342-347 - [c14]Anatoli Degtyarev, Andrei Voronkov:
General Connections via Equality Elimination. WOCFAI 1995: 109-120 - 1994
- [c13]Andrei Voronkov:
An Implementation Technique for a Class of Bottom-Up Procedures. PLILP 1994: 147-164 - 1993
- [c12]Vladimir Yu. Sazonov, Andrei Voronkov:
A Construction of Typed Lambda Models Related to Feasible Computability. Kurt Gödel Colloquium 1993: 301-312 - [e3]Andrei Voronkov:
Logic Programming and Automated Reasoning,4th International Conference, LPAR'93, St. Petersburg, Russia, July 13-20, 1993, Proceedings. Lecture Notes in Computer Science 698, Springer 1993, ISBN 3-540-56944-8 [contents] - 1992
- [c11]Andrei Voronkov:
Theorem Proving in Non-Standard Logics Based on the Inverse Method. CADE 1992: 648-662 - [c10]Andrei Voronkov:
On Computability by Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 165- - [c9]Andrei Voronkov:
Higher Order Functions in First Order Theory. ISTCS 1992: 43-54 - [e2]Andrei Voronkov:
Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990 - Second Russian Conference on Logic Programming, St. Petersburg, Russia, September 11-16, 1991, Proceedings. Lecture Notes in Computer Science 592, Springer 1992, ISBN 3-540-55460-2 [contents] - [e1]Andrei Voronkov:
Logic Programming and Automated Reasoning,International Conference LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings. Lecture Notes in Computer Science 624, Springer 1992, ISBN 3-540-55727-X [contents] - 1991
- [c8]Andrei Voronkov:
On Completeness of Program Synthesis Systems. CSL 1991: 411-418 - [c7]Andrei Voronkov:
Logic Programming with Bounded Quantifiers. RCLP 1991: 486-514 - [c6]Harold Boley, Micha Meier, Chris Moss, Michael M. Richter, Andrei Voronkov:
Declarative and Procedural Paradigms - Do they Really Compete? (Panel). PDK 1991: 383-398 - 1990
- [c5]Andrei Voronkov:
LISS - The Logic Inference Search System. CADE 1990: 677-678 - [c4]Andrei Voronkov:
Towards the Theory of Programming in Constructive Logic. ESOP 1990: 421-435
1980 – 1989
- 1988
- [c3]Sergei Starchenko, Andrei Voronkov:
On connections between classical and constructive semantics. Conference on Computer Logic 1988: 275-285 - [c2]Andrei Voronkov:
A proof-search method for the first-order logic. Conference on Computer Logic 1988: 327-338 - 1987
- [c1]Andrei Voronkov:
Deductive Program Synthesis and Markov's Principle. FCT 1987: 479-482
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-31 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
