| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Andrei Voronkov 54 Anatoli Degtyarev , Andrei Voronkov: Stratified Resolution. CADE 2000 : 365-384 53 Alexandre Riazanov , Andrei Voronkov: Partially Adaptive Code Trees. JELIA 2000 : 209-223 52 Andrei Voronkov: Deciding K using inverse-K. KR 2000 : 198-209 51 Tatiana Rybina , Andrei Voronkov: A Decision Procedure for Term Algebras with Queues. LICS 2000 : 279-290 50 Konstantin Korovin , Andrei Voronkov: A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering. LICS 2000 : 291-302 49 Andrei Voronkov: How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi. LICS 2000 : 401-412 48 Evgeny Dantsin , Andrei Voronkov: Expressive Power and Data Complexity of Query Languages for Trees and Lists. PODS 2000 : 157-165 47 Melvin Fitting , Lars Thalmann , Andrei Voronkov: Term-Modal Logics. TABLEAUX 2000 : 220-236 46 Anatoli Degtyarev , Yuri Gurevich , Paliath Narendran , Margus Veanes , Andrei Voronkov: Decidability and complexity of simultaneous rigid E-unification with one variable and related results. TCS 243 (1-2): 167-184 (2000) 45 Alexandre Riazanov , Andrei Voronkov: Vampire. CADE 1999 : 292-296 44 Andrei Voronkov: KK: a theorem prover for K. CADE 1999 : 383-387 43 Evgeny Dantsin , Andrei Voronkov: A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. FoSSaCS 1999 : 180-196 42 Yuri Gurevich , Andrei Voronkov: Monadic Simultaneous Rigid E-unification. TCS 222 (1-2): 133-152 (1999) 41 Andrei Voronkov: Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem. TCS 224 (1-2): 319-352 (1999) 40 Leo Bachmair , Harald Ganzinger , Andrei Voronkov: Elimination of Equality via Transformation with Ordering Constraints. CADE 1998 : 175-190 39 Andrei Voronkov: Herbrand's Theorem, Automated Reasoning and Semantics Tableaux. LICS 1998 : 252-263 38 Sergei G. Vorobyov , Andrei Voronkov: Complexity of Nonrecursive Logic Programs with Complex Values. PODS 1998 : 244-253 37 Anatoli Degtyarev , Yuri Gurevich , Paliath Narendran , Margus Veanes , Andrei Voronkov: The Decidability of Simultaneous Rigid E -Unification with One Variable. RTA 1998 : 181-195 36 Anatoli Degtyarev , Andrei Voronkov: What You Always Wanted to Know about Rigid E-Unification. Journal of Automated Reasoning 20 (1): 47-80 (1998) 35 Andrei Voronkov: Proof Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E -Unification. Journal of Automated Reasoning 21 (2): 205-231 (1998) 34 Yuri Gurevich , Andrei Voronkov: Monadic Simultaneous Rigid E-Unification and Related Problems. ICALP 1997 : 154-165 33 Evgeny Dantsin , Thomas Eiter , Georg Gottlob , Andrei Voronkov: Complexity and Expressive Power of Logic Programming. IEEE Conference on Computational Complexity 1997 : 82-101 32 Andrei Voronkov: Strategies in Rigid-Variable Methods. IJCAI (1) 1997 : 114-121 31 Evgeny Dantsin , Andrei Voronkov: Complexity of Query Answering in Logic Databases with Complex Values. LFCS 1997 : 56-66 30 Andrei Voronkov: Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification. CADE 1996 : 32-46 29 Anatoli Degtyarev , Andrei Voronkov: Equality Elimination for the Tableau Method. DISCO 1996 : 46-60 28 Martin Argenius , Andrei Voronkov: Semantics of Constraint Logic Programs with Bounded Quantifiers. ELP 1996 : 1-18 27 Anatoli Degtyarev , Andrei Voronkov: Handling Equality in Logic Programming via Basic Folding. ELP 1996 : 119-136 26 Andrei Voronkov: Merging Relational Database Technology with Constraint Technology. Ershov Memorial Conference 1996 : 409-419 25 Anatoli Degtyarev , Andrei Voronkov: What You Always Wanted to Know About Rigid E-Unification. JELIA 1996 : 50-69 24 Anatoli Degtyarev , Yuri Matiyasevich , Andrei Voronkov: Simultaneous E-Unification and Related Algorithmic Problems. LICS 1996 : 494-502 23 Anatoli Degtyarev , Andrei Voronkov: Decidability Problems for the Prenex Fragment of Intuitionistic Logic. LICS 1996 : 503-512 22 Andrei Voronkov: Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction. TABLEAUX 1996 : 312-329 21 Anatoli Degtyarev , Andrei Voronkov: A Note on Semantics of Logic Programs with Equality Based on Complete Sets of E-Unifiers. JLP 28 (3): 207-216 (1996) 20 Anatoli Degtyarev , Andrei Voronkov: The Undecidability of Simultaneous Rigid E-Unification. TCS 166 (1&2): 291-300 (1996) 19 Anatoli Degtyarev , Andrei Voronkov: Simultaneous Regid E-Unification Is Undecidable. CSL 1995 : 178-190 18 Anatoli Degtyarev , Andrei Voronkov: A New Procedural Interpretation of Horn Clauses with Equality. ICLP 1995 : 565-579 17 Anatoli Degtyarev , Andrei Voronkov: Equality Elimination for the Inverse Method and Extension Procedures. IJCAI 1995 : 342-347 16 Anatoli Degtyarev , Andrei Voronkov: General Connections via Equality Elimination. WOCFAI 1995 : 109-120 15 Andrei Voronkov: On Computability by Logic Programs. Annals of Mathematics and Artificial Intelligence 15 (3-4): 437-456 (1995) 14 Andrei Voronkov: The Anatomy of Vampire Implementing Bottom-up Procedures with Code Trees. Journal of Automated Reasoning 15 (2): 237-265 (1995) 13 Andrei Voronkov: An Implementation Technique for a Class of Bottom-Up Procedures. PLILP 1994 : 147-164 12 Vladimir Yu. Sazonov , Andrei Voronkov: A Construction of Typed Lambda Models Related to Feasible Computability. Kurt Gödel Colloquium 1993 : 301-312 11 Andrei Voronkov: Theorem Proving in Non-Standard Logics Based on the Inverse Method. CADE 1992 : 648-662 10 Andrei Voronkov: Higher Order Functions in First Order Theory. ISTCS 1992 : 43-54 9 Andrei Voronkov: On Computability by Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992 : 165- 8 Andrei Voronkov: On Completeness of Program Synthesis Systems. CSL 1991 : 411-418 7 Harold Boley , Micha Meier , Chris Moss , Michael M. Richter , Andrei Voronkov: Declarative and Procedural Paradigms - Do they Really Compete? (Panel). PDK 1991 : 383-398 6 Andrei Voronkov: Logic Programming with Bounded Quantifiers. RCLP 1991 : 486-514 5 Andrei Voronkov: LISS - The Logic Inference Search System. CADE 1990 : 677-678 4 Andrei Voronkov: Towards the Theory of Programming in Constructive Logic. ESOP 1990 : 421-435 3 Sergei Starchenko , Andrei Voronkov: On connections between classical and constructive semantics. Conference on Computer Logic 1988 : 275-285 2 Andrei Voronkov: A proof-search method for the first-order logic. Conference on Computer Logic 1988 : 327-338 1 Andrei Voronkov: Deductive Program Synthesis and Markov's Principle. FCT 1987 : 479-482 DiSC'01 Copyright ©2002 ACM Inc. |
