Papers by Andrei Voronkov

Submitted or accepted

  1. Konstantin Korovin and Andrei Voronkov
    Orienting Rewrite Rules with the Knuth-Bendix Order
    Information and Computation, submitted, 22pp, postscript

  2. Anatoli Degtyarev and Andrei Voronkov
    Handling Equality in Logic Programming via Basic Folding
    Journal of Symbolic Computation, accepted, 37pp

  3. Andrei Voronkov
    Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction and Related Complexity Problems
    Logic Journal of IGPL, accepted, 26 pp, postscript

  4. Evgeny Dantsin, Thomas Eiter, Georg Gottlob and Andrei Voronkov
    Complexity and Expressive Power of Logic Programming
    ACM Computing Surveys, to appear, 67pp, postscript

  5. Melvin Fitting, Lars Thalman and Andrei Voronkov
    Term-Modal Logics
    Studia Logica, to appear, 36 pp, postscript

  6. Alexander Riazanov and Andrei Voronkov
    Limited Resource Strategy in Resolution Theorem Proving
    Journal of Symbolic Computation, accepted, 14pp, postscript

  7. Evgeny Dantsin and Andrei Voronkov
    Expressive Power and Data Complexity of First-Order Logic over Trees
    Journal of Computer and System Sciences, accepted, 14pp, postscript

  8. Anatoli Degtyarev, Robert Nieuwenhuis and Andrei Voronkov
    Stratified Resolution
    Journal of Symbolic Computation, accepted, 18pp, postscript

  9. Alexander Riazanov and Andrei Voronkov
    Adaptive saturation-based reasoning
    PSI 2001
    LNCS vol. ???, 14 pp, postscript

  10. Dmitri Chubarov and Andrei Voronkov
    Solving First-Order Constraints over the Monadic Class
    LATIN 2001
    submitted, 8 pp, postscript

2001

  1. Anatoli Degtyarev and Andrei Voronkov
    Kanger's Choices in Automated Reasoning
    Collected papers of Stig Kanger with Essays on his Life and Work, v. II, Kluwer, 2001, to appear, 15pp, postscript

  2. Alexander Riazanov and Andrei Voronkov
    Splitting without backtracking
    Preprint CSPP-10, Department of Computer Science, University of Manchester, 2001, postscript

  3. Konstantin Korovin and Andrei Voronkov
    Verifying orientability of rewrite rules using the Knuth-Bendix order
    Preprint CSPP-11, Department of Computer Science, University of Manchester, 2001, postscript

  4. Anatoli Degtyarev, Yuri Gurevich and Andrei Voronkov
    Herbrand's Theorem and Equational Reasoning: Problems and Solutions
    Current Trends in Theoretical Computer Science. Entering the 21st Century, 2001, pp 303-326, postscript

  5. Anatoli Degtyarev and Andrei Voronkov
    The inverse method
    Handbook of Automated Reasoning, Volume I, Elsevier Science and MIT Press, 2001, pp 179-272, postscript

  6. I.V. Ramakrishnan, R.Sekar and Andrei Voronkov
    Term indexing
    Handbook of Automated Reasoning, Volume II, Elsevier Science and MIT Press, 2001, pp 1853-1964, postscript

  7. Anatoli Degtyarev and Andrei Voronkov
    Equality reasoning in sequent-based calculi
    Handbook of Automated Reasoning, Volume I, Elsevier Science and MIT Press, 2001, pp 611-706, postscript

  8. Andrei Voronkov
    How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi
    ACM Transactions on Computational Logic, 2:2, 2001, pp 182-215, postscript

  9. Tatiana Rybina and Andrei Voronkov
    A Decision Procedure for Term Algebras with Queues
    ACM Transactions on Computational Logic, 2:2, 2001, pp 155-181, postscript

  10. Alan Robinson and Andrei Voronkov (eds)
    Handbook of Automated Reasoning, vol.I
    Elsevier Science and MIT Press, 2001

  11. Alan Robinson and Andrei Voronkov (eds)
    Handbook of Automated Reasoning, vol.II
    Elsevier Science and MIT Press, 2001

  12. Konstantin Korovin and Andrei Voronkov
    Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
    RTA 2001
    LNCS 2051, 2001, pp 137-153, postscript

  13. Alexander Riazanov and Andrei Voronkov
    Vampire 1.1 (System Description)
    IJCAR 2001
    LNAI 2083, 2001, pp 376-380, postscript

  14. Robert Nieuwenhuis, Thomas Hillenbrand, Alexander Riazanov and Andrei Voronkov
    On the Evaluation of Indexing Techniques for Theorem Proving
    IJCAR 2001
    LNAI 2083, 2001, pp 257-271, postscript

  15. Andrei Voronkov
    Algorithms, Datastructures, and Other Issues in Efficient Automated Deduction
    IJCAR 2001
    LNAI 2083, 2001, pp 13-28, postscript

  16. Konstantin Korovin and Andrei Voronkov
    Knuth-Bendix ordering constraint solving is NP-complete
    ICALP 2001
    LNCS 2076, 2001, pp 979-992, postscript

  17. Alexander Riazanov and Andrei Voronkov
    Splitting without backtracking
    IJCAI 2001
    vol. 1, 2001, pp 611-617, postscript

2000

  1. Konstantin Korovin and Andrei Voronkov
    Knuth-Bendix constraint solving is NP-complete
    Preprint CSPP-8, Department of Computer Science, University of Manchester, 2000, postscript

  2. Andrei Voronkov
    How to Optimize Proof-Search in Modal Logics: a new Way of Proving Redundancy Criteria for Sequent Calculi
    Preprint CSPP-1, Department of Computer Science, University of Manchester, 2000, postscript

  3. Tatiana Rybina and Andrei Voronkov
    A Decision Procedure for Term Algebras with Queues
    Preprint CSPP-2, Department of Computer Science, University of Manchester, 2000, postscript

  4. Konstantin Korovin and Andrei Voronkov
    A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering
    Preprint CSPP-3, Department of Computer Science, University of Manchester, 2000, postscript

  5. Andrei Voronkov
    CASC 16 1/2
    Preprint CSPP-4, Department of Computer Science, University of Manchester, 2000, postscript

  6. Alexander Riazanov and Andrei Voronkov
    Even Faster Code Trees
    Preprint CSPP-5, Department of Computer Science, University of Manchester, 2000, postscript

  7. Andrei Voronkov
    Deciding K using KK
    KR 2000
    KR 2000, 2000, pp 198-209, postscript

  8. Evgeny Dantsin and Andrei Voronkov
    Expressive power and data complexity of nonrecursive query languages for lists and trees
    PODS 2000
    Principles of Database Systems, 2000, pp 157-165, postscript

  9. Andrei Voronkov
    How to Optimize Proof-Search in Modal Logics: a new Way of Proving Redundancy Criteria for Sequent Calculi
    LICS 2000
    Logic in Computer Science, 2000, pp 401-412, postscript

  10. Tatiana Rybina and Andrei Voronkov
    A decision procedure for term algebras with queues
    LICS 2000
    Logic in Computer Science, 2000, pp 279-290, postscript

  11. Konstantin Korovin and Andrei Voronkov
    A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
    LICS 2000
    Logic in Computer Science, 2000, pp 291-302, postscript

  12. Melvin Fitting, Lars Thalman and Andrei Voronkov
    Term-Modal Logics
    TABLEAUX 2000
    LNAI 1847, 2000, pp 220-236, postscript

  13. Anatoli Degtyarev and Andrei Voronkov
    Stratified Resolution
    CADE 2000
    LNAI 1831, 2000, pp 365-384, postscript

  14. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes and Andrei Voronkov
    The Decidability of Simultaneous Rigid E-Unification with One Variable and Related Results
    Theoretical Computer Science, 243, 1-2, 2000, pp 167-184, postscript

  15. Alexander Riazanov and Andrei Voronkov
    Partially Adaptive Code Trees
    JELIA 2000
    LNAI 1919, 2000, pp 209-223, postscript

  16. Michel Parigot and Andrei Voronkov (eds)
    Seventh International Conference on Logic for Programming and Automated Reasoning, LPAR 2000, LNAI 1955
    Springer Verlag, 2000

  17. Alexander Riazanov and Andrei Voronkov
    Limited Resource Strategy in Resolution Theorem Proving
    Preprint CSPP-7, Department of Computer Science, University of Manchester, 2000, postscript

1999

  1. David McAllester, Harald Ganzinger and Andrei Voronkov (eds)
    Sixth International Conference on Logic for Programming and Automated Reasoning, LPAR'99, LNAI 1705
    Springer Verlag, 1999

  2. Larisa Maksimova and Andrei Voronkov
    Complexity of some problems in modal and superintuitionistic logics (abstract)
    Logic Colloquium '99, Abstracts, Utrecht, 1999, postscript

  3. Yuri Gurevich and Andrei Voronkov
    Monadic Simultaneous Rigid E-Unification
    Theoretical Computer Science, vol 222, 1999, pp 133-152, postscript

  4. Andrei Voronkov
    Simultaneous rigid E-unification and other decision problems related to Herbrand's theorem
    Theoretical Computer Science, vol 224, 1999, pp 319-352, postscript

  5. Andrei Voronkov
    The Ground-Negative Fragment of First-Order Logic is pi_2^p-complete
    Journal of Symbolic Logic, 64:3, 1999, pp 984-990, postscript

  6. Andrei Voronkov
    Model Theory Based on the Notion of Truth in the Constructive Sense
    American Mathematical Society Translations, 195, 1999, pp 145-164

  7. Evgeny Dantsin, Thomas Eiter, Georg Gottlob and Andrei Voronkov
    Complexity and Expressive Power of Logic Programming
    Technical report INFSYS RR-1843-99-05, Institut für Informationssysteme, Technische Universität Wien, 1999, postscript

  8. Evgeny Dantsin and Andrei Voronkov
    A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
    FOSSACS'99
    LNCS 1578, 1999, pp 180-196, postscript

  9. Andrei Voronkov
    KK: a Theorem Prover for K
    CADE-16
    LNAI 1632, 1999, pp 383-387, postscript

  10. Alexander Riazanov and Andrei Voronkov
    Vampire
    CADE-16
    LNAI 1632, 1999, pp 292-296, postscript

1998

  1. Burkhard Freitag, Hendrik Decker, Michael Kifer and Andrei Voronkov (eds)
    Transactions and Change in Logic Databases, LNCS 1472
    Springer Verlag, 1998

  2. Anatoli Degtyarev and Andrei Voronkov
    What You Always Wanted to Know About Rigid E-Unification
    Journal of Automated Reasoning, 20:1, 1998, pp 47-80, postscript

  3. Andrei Voronkov
    Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
    Journal of Automated Reasoning, 21, 1998, pp 205-231, postscript

  4. Andrei Voronkov
    Herbrand's theorem, automated reasoning and semantic tableaux
    Technical report 151, Uppsala University, Computing Science Department, 1998, postscript

  5. Andrei Voronkov
    Simultaneous rigid E-unification and other decision problems related to Herbrand's theorem
    Technical report 152, Uppsala University, Computing Science Department, 1998, postscript

  6. Anatoli Degtyarev and Andrei Voronkov
    Equality reasoning in sequent-based calculi
    Technical report MPI-I-98-2-011, Max-Planck Institut für Informatik, Saarbrücken, 1998, postscript

  7. Evgeny Dantsin and Andrei Voronkov
    Expressive power and data complexity of nonrecursive logic programming
    Technical report 156, Uppsala University, Computing Science Department, 1998, postscript

  8. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes and Andrei Voronkov
    The Decidability of Simultaneous Rigid E-Unification with One Variable
    RTA'98
    LNCS 1379, 1998, pp 181-195, postscript

  9. Sergei Vorobyov and Andrei Voronkov
    Complexity of Nonrecursive Logic Programs with Complex Values
    PODS'98
    Principles of Database Systems, 1998, pp 244-253, postscript

  10. Andrei Voronkov
    Herbrand's theorem, automated reasoning and semantic tableaux
    LICS'98
    IEEE, 1998, pp 252-263, postscript

  11. Leo Bachmair, Harald Ganzinger and Andrei Voronkov
    Elimination of Equality via Transformation with Ordering Constraints
    CADE-15
    LNAI 1421, 1998, pp 175-190, postscript

1997

  1. Andrei Voronkov
    Strategies in Rigid-Variable Methods
    IJCAI'97
    vol.1, 1997, pp 114-119, postscript

  2. Andrei Voronkov
    Rigid Variables Considered Harmful
    Technical report 134, Uppsala University, Computing Science Department, 1997, postscript

  3. Yuri Gurevich and Andrei Voronkov
    Monadic Simultaneous Rigid E-Unification and Related Problems
    Technical report 137, Uppsala University, Computing Science Department, 1997, postscript

  4. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes and Andrei Voronkov
    The Decidability of Simultaneous Rigid E-Unification with One Variable
    Technical report 139, Uppsala University, Computing Science Department, 1997, postscript

  5. Anatoli Degtyarev and Andrei Voronkov
    What you Always Wanted to Know About Rigid E-Unification
    Technical report 143, Uppsala University, Computing Science Department, 1997, postscript

  6. Andrei Voronkov
    The Ground-Negative Fragment of First-Order Logic is Pi_2^p-complete
    Technical report 144, Uppsala University, Computing Science Department, 1997, postscript

  7. Evgeny Dantsin and Andrei Voronkov
    Complexity of Query Answering in Logic Databases with Complex Data
    Technical report 149, Uppsala University, Computing Science Department, 1997, postscript

  8. Evgeny Dantsin and Andrei Voronkov
    Bag and Set Unification
    Technical report 150, Uppsala University, Computing Science Department, 1997, postscript

  9. Sergei Vorobyov and Andrei Voronkov
    Complexity of Nonrecursive Logic Programs with Complex Values
    Technical report MPI-I-97-2-010, Max-Planck Institut für Informatik, Saarbrücken, 1997, postscript

  10. Leo Bachmair, Harald Ganzinger and Andrei Voronkov
    Elimination of Equality via Transformation with Ordering Constraints
    Technical report MPI-I-97-2-012, Max-Planck Institut für Informatik, Saarbrücken, 1997, postscript

  11. Evgeny Dantsin, Thomas Eiter, Georg Gottlob and Andrei Voronkov
    Complexity and Expressive Power of Logic Programming
    CCC'97
    Twelfth Annual IEEE Conference on Computational Complexity, 1997, pp 82-101, postscript

  12. Yuri Gurevich and Andrei Voronkov
    Monadic Simultaneous Rigid E-Unification and Related Problems
    ICALP'97
    LNCS, 1256, , 1997, pp 154-165, postscript

  13. Evgeny Dantsin and Andrei Voronkov
    Complexity of Query Answering in Logic Databases with Complex Values
    LFCS'97
    LNCS 1234, 1997, pp 56-66, postscript

1996

  1. Anatoli Degtyarev and Andrei Voronkov
    Equality Elimination for the Tableau Method
    DISCO'96
    Design and Implementation of Symbolic Computation Systems, LNCS, 1128, 1996, pp 46-60, postscript

  2. Anatoli Degtyarev and Andrei Voronkov
    A Note on Semantics of Logics Programs with Equality Based on Complete Sets of E-Unifiers
    Journal of Logic Programming, 28:3, 1996, pp 207-216, postscript

  3. Anatoli Degtyarev and Andrei Voronkov
    The Undecidability of Simultaneous Rigid E-Unification
    Theoretical Computer Science, 166:1-2, 1996, pp 291-300, postscript

  4. Anatoli Degtyarev, Yuri Gurevich and Andrei Voronkov
    Herbrand's Theorem and Equational Reasoning: Problems and Solutions
    Bulletin of the European Association for Theoretical Computer Science, v.60, 1996, pp 78-95, postscript

  5. Andrei Voronkov
    Proof-Search in Intuitionistic Logic Based on the Constraint Satisfaction
    Technical report 120, Uppsala University, Computing Science Department, 1996, postscript

  6. Andrei Voronkov
    On Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
    Technical report 121, Uppsala University, Computing Science Department, 1996, postscript

  7. Anatoli Degtyarev, Yuri Gurevich and Andrei Voronkov
    Herbrand's Theorem and Equational Reasoning: Problems and Solutions
    Technical report 128, Uppsala University, Computing Science Department, 1996, postscript

  8. Martin Argenius and Andrei Voronkov
    Semantics of Constraint Logic Programs with Bounded Quantifiers
    ELP'96
    Extensions of Logic Programming, LNCS 1050, 1996, pp 1-18, postscript

  9. Andrei Voronkov
    Merging Relational Database Technology with the Constraint Technology
    PSI'96
    Perspectives of System Informatics. Andrei Ershov Second International Memorial Conference, LNCS 1181, 1996, pp 409-419

  10. Anatoli Degtyarev and Andrei Voronkov
    Handling Equality in Logic Programs via Basic Folding
    ELP'96
    Extensions of Logic Programming, LNCS 1050, 1996, pp 119-136, postscript

  11. Andrei Voronkov
    Proof Search in Intuitionistic Logic Based on Constraint Satisfaction
    TABLEAUX'96
    Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071, 1996, pp 312-329, postscript

  12. Anatoli Degtyarev and Andrei Voronkov
    Simultaneous Rigid E-Unification is Undecidable
    CSL'95
    Computer Science Logic, LNCS 1092, 1996, pp 178-190, postscript

  13. Anatoli Degtyarev, Yuri Matiyasevich and Andrei Voronkov
    Simultaneous Rigid E-Unification and Related Algorithmic Problems
    LICS'96
    Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996, pp 494-502, postscript

  14. Andrei Voronkov
    Proof Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
    CADE'96
    LNCS, 1104, 1996, pp 32-46, postscript

  15. Anatoli Degtyarev and Andrei Voronkov
    Decidability Problems for the Prenex Fragment of Intuitionistic Logic
    LICS'96
    Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996, pp 503-512, postscript

  16. Anatoli Degtyarev and Andrei Voronkov
    What You Always Wanted to Know About Rigid E-Unification
    JELIA'96
    Logics in Artificial Intelligence. European Workshop, LNAI 1126, 1996, pp 50-69, postscript

1995

  1. Anatoli Degtyarev and Andrei Voronkov
    Equality Elimination for the Inverse Method and Extension Procedures
    IJCAI'95
    vol. 1, 1995, pp 342-347, postscript

  2. Andrei Voronkov
    The Anatomy of Vampire: Implementing Bottom-Up Procedures with Code Trees
    Journal of Automated Reasoning, 15:2, 1995, pp 237-265, postscript

  3. Andrei Voronkov
    On Computability by Logic Programs
    Annals of Mathematics and Artificial Intelligence, 15:3,4, 1995, pp 437-456, postscript

  4. Anatoli Degtyarev and Andrei Voronkov
    General Connections via Equality Elimination
    Technical report 93, Uppsala University, Computing Science Department, 1995, postscript

  5. Anatoli Degtyarev, Yuri Koval and Andrei Voronkov
    Handling Equality in Logic Programming via Basic Folding
    Technical report 101, Uppsala University, Computing Science Department, 1995, postscript

  6. Anatoli Degtyarev and Andrei Voronkov
    Simultaneous Rigid E-Unification is not so Simple
    Technical report 104, Uppsala University, Computing Science Department, 1995, postscript

  7. Anatoli Degtyarev and Andrei Voronkov
    Simultaneous Rigid E-Unification is Undecidable
    Technical report 105, Uppsala University, Computing Science Department, 1995, postscript

  8. Anatoli Degtyarev and Andrei Voronkov
    Reduction of Second-Order Unification to Simultaneous Rigid E-Unification
    Technical report 109, Uppsala University, Computing Science Department, 1995, postscript

  9. Martin Argenius and Andrei Voronkov
    Semantics of Constraint Logic Programs with Bounded Quantifiers
    Technical report 115, Uppsala University, Computing Science Department, 1995, postscript

  10. Anatoli Degtyarev and Andrei Voronkov
    A Note on Semantics of Logics Programs with Equality Based on Complete Sets of -Unifiers
    Technical report 118, Uppsala University, Computing Science Department, 1995, postscript

  11. Anatoli Degtyarev and Andrei Voronkov
    A New Procedural Interpretation of Horn Clauses with Equality
    ICLP'95
    Twelfth International Conference on Logic Programming, MIT Press, 1995, pp 565-579, postscript

  12. Anatoli Degtyarev and Andrei Voronkov
    General Connections via Equality Elimination
    WOCFAI-95
    Second World Conference on the Fundamentals of Artificial Intelligence, Angkor, Paris, 1995, pp 109-120, postscript

1994

  1. Andrei Voronkov
    An Implementation Technique for a Class of Bottom-Up Procedures
    PLILP'94
    LNCS 844, 1994, pp 147-164, postscript

  2. Andrei Voronkov
    Implementing Bottom-Up Procedures with Code Trees (Abstract of the Invited Talk) (abstract)
    International Symposium on Fifth Generation Computer Systems. Workshop on Automated Theorem Proving. Institute for New Generation Computer Technology, 1994

  3. Andrei Voronkov
    Implementing Bottom-up Procedures with Code Trees: a Case Study of Forward Subsumption
    Technical report 88, Uppsala University, Computing Science Department, 1994, postscript

  4. Anatoli Degtyarev and Andrei Voronkov
    A New Procedural Interpretation of Horn Clauses with Equality
    Technical report 89, Uppsala University, Computing Science Department, 1994, postscript

  5. Anatoli Degtyarev and Andrei Voronkov
    Equality Elimination for Semantic Tableaux
    Technical report 90, Uppsala University, Computing Science Department, 1994, postscript

  6. Anatoli Degtyarev and Andrei Voronkov
    Equality Elimination for the Inverse Method and Extension Procedures
    Technical report 92, Uppsala University, Computing Science Department, 1994, postscript

1993

  1. Vladimir Sazonov and Andrei Voronkov
    A Construction of Typed Lambda Model Related to Feasible Computability
    Technical report , INRIA-CRIN-CNRS, 1993

  2. Andrei Voronkov (eds)
    Logic Programming and Automated Reasoning, Proceedings of LPAR'93, LNAI 698
    Springer Verlag, 1993

  3. Vladimir Sazonov and Andrei Voronkov
    A Construction of Typed Lambda Model Related to Feasible Computability
    KGC'93
    Proceedings of the Third Kurt Godel Colloquium, LNCS 713, 1993, pp 301-312, postscript

1992

  1. Andrei Voronkov
    Extracting Higher Order Functions from First Order Proofs
    Technical report ECRC-92-7, European Computer Industry Research Center, 1992, postscript

  2. Andrei Voronkov (eds)
    Logic Programming and Automated Reasoning, LPAR'92, LNAI 624
    Springer Verlag, 1992

  3. Andrei Voronkov (eds)
    Logic Programming, LNAI 592
    Springer Verlag, 1992

  4. Andrei Voronkov
    On Computability by Logic Programs
    Workshop "Structural Complexity and Recursion-Theoretic Methods in Logic Programming", Cornell University, 1992, pp 165-174, postscript

  5. Andrei Voronkov
    Higher Order Functions in First Order Logics
    ISTCS'92
    LNCS 601, 1992, pp 43-54, postscript

  6. Andrei Voronkov
    Logic Programming with Bounded Quantifiers
    RCLP'91
    Russian Conference on Logic Programming, LNAI 592, 1992, pp 486-514, postscript

  7. Andrei Voronkov
    Theorem Proving in Non-standard Logics Based on the Inverse Method
    CADE-11
    LNAI 607, 1992, pp 648-662, postscript

  8. Andrei Voronkov
    On Completeness of Program Synthesis Systems
    CSL'91
    LNCS 626, 1992, pp 411-419, postscript

  9. Andrei Voronkov
    LISS - the Logic Inference Search System
    CADE'90
    LNCS 449, 1992, pp 677-678

  10. Andrei Voronkov
    Logic Programming with Bounded Quantifiers
    Technical report ECRC-92-29, European Computer Industry Research Center, 1992, postscript

  11. Andrei Voronkov
    On Computability by Logic Programs
    Technical report ECRC-92-8, European Computer Industry Research Center, 1992, postscript

1991

  1. Valentin Antimirov, Anatoli Degtyarev, Vladimir Procenko, Andrei Voronkov and Mikhael Zakharyaschev
    Mathematical Logic in Programming (in Russian)
    Mathematical Logic in Programming, Moscow, Mir, 1991, pp 331-407

  2. Andrei Voronkov
    What is declarative programming
    PDK'91
    LNAI 567, 1991, pp 394-398

  3. Andrei Voronkov
    Do we really know what "declarative" means
    PDK'91
    Preliminary Publications, Kaiserslautern, Germany, 1991,

  4. Andrei Voronkov
    N-realizability: one more constructive semantics
    Technical report 71, Department of Mathematics, Monash University, 1991

  5. Andrei Voronkov
    On completeness of program synthesis systems
    Technical report 29, Univ. Paris 7, Equipe de Logique Mathematique, 1991

1990

  1. Andrei Voronkov
    Object-oriented programming in TILL (in Russian) (abstract)
    Proc. Soviet Conf. on Object-Oriented Programming, Tallinn, 1990

  2. Andrei Voronkov
    Towards the theory of programming in constructive logic
    ESOP'90
    LNCS 432, 1990, pp 421-435

  3. Andrei Voronkov
    A proof-search method for the first order logic
    COLOG'88
    LNCS 417, 1990, pp 327-340

  4. Sergei Starchenko and Andrei Voronkov
    On connections between classical and constructive semantics
    COLOG'88
    LNCS 417, 1990, pp 275-285

  5. Andrei Voronkov
    TILL - language unifying Prolog and simulation (in Russian) (abstract)
    2nd Soviet Conference on Artificial Intelligence, Minsk, 1990

  6. Andrei Voronkov
    A constructive semantics of first-order formulas (abstract)
    Proc. of the 4th Asian Logical Conference, Tokyo, 1990

  7. Andrei Voronkov
    n-realizability: one more constructive semantics (abstract)
    Abstracts of the Asian Mathematical Conference, HongKong, 1990

  8. Andrei Voronkov
    On some applications of constructive logic to computer science (abstract)
    Abstract accepted to International Congress on Mathematics, Kyoto, Japan, 1990

  9. Andrei Voronkov
    Realizability, constructive logic and automated program synthesis (abstract)
    Abstracts of the Convention of Mathematische Gesellschaft, Hamburg, 1990

1989

  1. Andrei Voronkov
    Logic programming and Sigma-programming
    Cybernetics, 25:1, 1989, pp 67-72

  2. Andrei Voronkov
    LISS - the system for experiments in automated deduction
    Informatika-89, Int. Symp., USSR, Minsk, 1989, 6pp

1988

  1. Andrei Voronkov and Sergei Starchenko
    Enumerated model with decidable theory but undecidable constructive theory (in Russian) (abstract)
    Proc. 2nd Soviet Conf. on Applied Logic, Novosibirsk, 1988

  2. Andrei Korneichuk and Andrei Voronkov
    TILL - the logic programming language for process simulation
    COLOG-88
    Preliminary proceedings, vol.2, Tallinn, 1988, pp 142-150

  3. Andrei Voronkov
    A proof search method for first order logic
    COLOG-88
    Preliminary proceedings, vol.2, Tallinn, 1988, pp 104-118

  4. Sergei Starchenko and Andrei Voronkov
    On connections between classical and constructive semantics
    COLOG-88
    Preliminary proceedings, vol.1, Tallinn, 1988, pp 101-112

  5. Valeri Agafonov, Vladimir Borshchev and Andrei Voronkov
    Logic programming in the wide sense: a survey (in Russian)
    Logic Programming, Mir, Moscow, 1988, pp 1-108

  6. Andrei Voronkov
    Model theory based on a constructive notion of truth (in Russian)
    Model Theory and its Applications, Trudy Instituta Matematiki vol. 8, Nauka, Novosibirsk, 1988, pp 25-42

  7. Andrei Voronkov
    Constructive truth and constructive calculi
    Soviet Mathematical Doklady, 37:2, 1988, pp 83-91

  8. Andrei Voronkov
    A Connection Between Gentzen-Style Proofs and Resolution-Style Proofs (in Russian) (abstract)
    Proc. of the Soviet All-Union Conference on Semiotic Aspects of the Formalization of Intelligent Activity, Nal'chik, 1988

  9. Andrei Voronkov and Andrei Korneichuk
    Translator of a logic programming language (in Russian) (abstract)
    Proc. Soviet Conf. on Methods of Translation and Program Construction, Novosibirsk, 1988

  10. Andrei Voronkov and Sergei Starchenko
    A proof search system (in Russian) (abstract)
    Proc. 1st Soviet Conf. on Artificial Intelligence, Moscow, 1988

  11. Andrei Voronkov
    A criterion of coincidence of theory of the model with its constructive theory (in Russian) (abstract)
    Proc. 9th Soviet Conf. on Mathematical Logic, Leningrad, 1988

  12. Andrei Voronkov
    On semantics of Sigma-programs (in Russian) (abstract)
    Proc. 8th Soviet Conf. on Theoretical Cybernetics, Gorki, 1988

1987

  1. Andrei Voronkov
    Constructive logic: a semantic approach (abstract)
    Abstracts of the 8th Int. Congress on Logic, Methodology and Philosophy of Sci., v.5, part 1, Moscow, Nauka, 1987

  2. Andrei Voronkov
    Deductive program synthesis and Markov's principle
    FCT'87
    Fundamentals of computation theory, LNCS 278, 1987, pp 479-482

  3. Andrei Voronkov
    Realizability and Program Synthesis (in Russian)
    PhD Thesis , Novosibirsk State University, 1987

  4. Anatoli Degtyarev and Andrei Voronkov
    Automated theorem proving II
    Cybernetics, 23:4, 1987, pp 547-556

  5. Andrei Voronkov
    A classification of several logical concepts in programming (in Russian) (abstract)
    Proc. of 11th Soviet Conf. on Intelligent Systems Problems, Novosibirsk, 1987

  6. Andrei Voronkov and Andrei Mantsivoda
    Natural language and logical inference in expert systems (in Russian) (abstract)
    Proc. of The Workshop on Technology of Expert Systems development, Kishinev, 1987

  7. Andrei Voronkov
    A proof search method and its modification for query answering (in Russian) (abstract)
    Proc. of The Workshop on Technology of Expert Systems development, Kishinev, 1987

1986

  1. Andrei Voronkov
    A Generalization of the Notion of Realizability (abstract)
    Siberian Mathematical Journal, 1986

  2. Andrei Voronkov
    Synthesis of logic programs (in Russian)
    Preprint 24, Institute of Mathematics, Novosibirsk, 1986

  3. Andrei Voronkov
    Logic programs and their synthesis (in Russian)
    Preprint 23, Institute of Mathematics, Novosibirsk, 1986

  4. Andrei Voronkov
    A natural calculus for Sigma-programs (in Russian)
    Vychislitelnye sistemy, v.120, Novosibirsk, 1986, pp 25-40

  5. Andrei Voronkov
    Computable functions and Markov's principle (in Russian)
    Vychislitelnye sistemy, v.116, Novosibirsk, , 1986, pp 102-110

  6. Anatoli Degtyarev and Andrei Voronkov
    Automated theorem proving I
    Cybernetics, 22:3, 1986, pp 290-297

  7. Anatoli Degtyarev and Andrei Voronkov
    Equality Control Methods in Machine Theorem Proving
    Cybernetics, 22:3, 1986, pp 298-307

  8. Andrei Voronkov and Andrei Mantsivoda
    Natural language in automated deduction (in Russian) (abstract)
    Proc. of the Soviet Workshop on Linguistic Aspects of Artificial Intelligence, Leningrad, 1986

  9. Andrei Voronkov
    Synthesizing programs from proofs in constructive list theory (in Russian) (abstract)
    Proc. Soviet Conf. on Synthesis, Testing, Verification and Debugging of Programs, Riga, 1986

  10. Andrei Voronkov
    An approach to the definition of constructive logic (in Russian) (abstract)
    Proc. 9th Soviet Workshop on Logic, Methodology and Philosophy of Science, Khar'kov, 1986

  11. Andrei Voronkov
    Methods of program execution in Sigma-programming (in Russian) (abstract)
    Proc. 4th Soviet Conf. on Applications of Mathematical Logic, Tallinn, 1986

  12. Andrei Voronkov
    Intuitionistic list theory (in Russian) (abstract)
    Proc. 8th Soviet Conference on Mathematical Logic, Moscow, 1986

1985

  1. Andrei Voronkov
    Automatic program synthesis and realizability (in Russian) (abstract)
    2nd Soviet Conf. on Mathematical Methods in Pattern Recognition, Erevan, 1985

  2. Andrei Voronkov
    A proof search method (in Russian)
    Vychislitelnye Sistemy, v.107, Novosibirsk, 1985, pp 109-123

  3. Andrei Voronkov and Dmitri Sviridenko
    On constructive logics (in Russian) (abstract)
    Proc. of the Soviet Conf. on Applied Logic, Novosibirsk, 1985

  4. Andrei Voronkov
    Constructive semantics for model theory (in Russian) (abstract)
    Proc. of the Soviet Conf. on Applied Logic, Novosibirsk, 1985

  5. Andrei Voronkov
    Constructive dynamic logics and information systems (in Russian) (abstract)
    Proc. of The Workshop on Program Synthesis, Izhevsk, 1985

1984

  1. Andrei Voronkov
    A direct proof search method (in Russian) (abstract)
    7th Soviet Conf. on Mathematical Logic, Novosibirsk, 1984