Andrei Voronkov - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected PapersEdmund M. Clarke, Andrei Voronkov, editors, Volume 6355 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Encoding industrial hardware verification problems into effectively propositional logicMoshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Andrei Voronkov. FMCAD 2010: 137-144 [doi]

Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. ProceedingsChristian G. Fermüller, Andrei Voronkov, editors, Volume 6397 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Invariant and Type Inference for MatricesThomas A. Henzinger, Thibaud Hottelier, Laura KovÃ¡cs, Andrei Voronkov. vmcai 2010: 163-179 [doi]

Interpolation and Symbol Elimination in VampireKrystof Hoder, Laura Kovács, Andrei Voronkov. cade 2010: 188-195 [doi]

Translating Regular Expression Matching into TransducersYasuhiko Minamide, Yuto Sakuma, Andrei Voronkov. synasc 2010: 107-115 [doi]

Perspectives of Systems Informatics, 7th International Andrei Ershov Memorial Conference, PSI 2009, Novosibirsk, Russia, June 15-19, 2009. Revised PapersAmir Pnueli, Irina Virbitskaite, Andrei Voronkov, editors, Volume 5947 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Evaluation of Automated Theorem Proving on the Mizar Mathematical LibraryJosef Urban, Krystof Hoder, Andrei Voronkov. icms 2010: 155-166 [doi]

2009

2008

Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. ProceedingsIliano Cervesato, Helmut Veith, Andrei Voronkov, editors, Volume 5330 of Lecture Notes in Computer Science, Springer, 2008.

Proof Systems for Effectively Propositional LogicJuan Antonio Navarro Pérez, Andrei Voronkov. cade 2008: 426-440 [doi]

Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, ProceedingsAndrei Voronkov, editor, Volume 5117 of Lecture Notes in Computer Science, Springer, 2008.

2007

Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, ProceedingsNachum Dershowitz, Andrei Voronkov, editors, Volume 4790 of Lecture Notes in Computer Science, Springer, 2007.

Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, ProceedingsVolker Diekert, Mikhail V. Volkov, Andrei Voronkov, editors, Volume 4649 of Lecture Notes in Computer Science, Springer, 2007.

Integrating Linear Arithmetic into Superposition CalculusKonstantin Korovin, Andrei Voronkov. csl 2007: 223-237 [doi]

Encodings of Problems in Effectively Propositional LogicJuan Antonio Navarro Pérez, Andrei Voronkov. sat 2007: 3 [doi]

Encodings of Bounded LTL Model Checking in Effectively Propositional LogicJuan Antonio Navarro Pérez, Andrei Voronkov. cade 2007: 346-361 [doi]

Perspectives of Systems Informatics, 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia, June 27-30, 2006. Revised PapersIrina Virbitskaite, Andrei Voronkov, editors, Volume 4378 of Lecture Notes in Computer Science, Springer, 2007.

2006

Deduction and Applications, 23.-28. October 2005Franz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov, editors, Volume 05431 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.

Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, ProceedingsMiki Hermann, Andrei Voronkov, editors, Volume 4246 of Lecture Notes in Computer Science, Springer, 2006.

Reasoning Support for Expressive Ontology Languages Using a Theorem ProverIan Horrocks, Andrei Voronkov. foiks 2006: 201-218 [doi]

Implementation of UNIDOOR, a Deductive Object-Oriented Database SystemMohammed K. Jaber, Andrei Voronkov. adbis 2006: 155-170 [doi]

UNIDOOR: a Deductive Object-Oriented Database Management SystemMohammed K. Jaber, Andrei Voronkov. icde 2006: 157 [doi]

Inconsistencies in OntologiesAndrei Voronkov. jelia 2006: 19 [doi]

2005

05431 Abstracts Collection - Deduction and ApplicationsFranz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov. dagstuhl 2006: [doi]

05431 Executive Summary - Deduction and ApplicationsFranz Baader, Peter Baumgartner, Robert Nieuwenhuis, Andrei Voronkov. dagstuhl 2006: [doi]

Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, ProceedingsFranz Baader, Andrei Voronkov, editors, Volume 3452 of Lecture Notes in Computer Science, Springer, 2005.

Basis of Solutions for a System of Linear Inequalities in Integers: Computation and ApplicationsDimitri Chubarov, Andrei Voronkov. mfcs 2005: 260-270 [doi]

Solving First-Order Constraints over the Monadic ClassDimitri Chubarov, Andrei Voronkov. BIRTHDAY 2005: 132-138 [doi]

Random Databases and Threshold for Monotone Non-recursive DatalogKonstantin Korovin, Andrei Voronkov. mfcs 2005: 591-602 [doi]

Knuth-Bendix constraint solving is NP-completeKonstantin Korovin, Andrei Voronkov. tocl, 6(2):361-388, 2005. [doi]

Finding Basic Block and Variable CorrespondenceIman Narasamdya, Andrei Voronkov. SAS 2005: 251-267 [doi]

Generation of Hard Non-Clausal Random Satisfiability ProblemsJuan Antonio Navarro Pérez, Andrei Voronkov. AAAI 2005: 436-442

Efficient instance retrieval with standard and relational path indexingAlexandre Riazanov, Andrei Voronkov. iandc, 199(1-2):228-252, 2005. [doi]

Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, ProceedingsGeoff Sutcliffe, Andrei Voronkov, editors, Volume 3835 of Lecture Notes in Computer Science, Springer, 2005.

2004

TeMP: A Temporal Monodic ProverUllrich Hustadt, Boris Konev, Alexandre Riazanov, Andrei Voronkov. cade 2004: 326-330 [doi]

Efficient Checking of Term Ordering ConstraintsAlexandre Riazanov, Andrei Voronkov. cade 2004: 60-74 [doi]

2003

Stratified resolutionAnatoli Degtyarev, Robert Nieuwenhuis, Andrei Voronkov. JSC, 36(1-2):79-99, 2003. [doi]

An AC-Compatible Knuth-Bendix OrderKonstantin Korovin, Andrei Voronkov. cade 2003: 47-59 [doi]

Orienting Equalities with the Knuth-Bendix OrderKonstantin Korovin, Andrei Voronkov. lics 2003: 75 [doi]

Orienting rewrite rules with the Knuth-Bendix orderKonstantin Korovin, Andrei Voronkov. iandc, 183(2):165-186, 2003. [doi]

Complexity of Some Problems in Modal and Intuitionistic CalculiLarisa Maksimova, Andrei Voronkov. csl 2003: 397-412 [doi]

Efficient Instance Retrieval with Standard and Relational Path IndexingAlexandre Riazanov, Andrei Voronkov. cade 2003: 380-396 [doi]

Limited resource strategy in resolution theorem provingAlexandre Riazanov, Andrei Voronkov. JSC, 36(1-2):101-115, 2003. [doi]

A Logical Reconstruction of ReachabilityTatiana Rybina, Andrei Voronkov. ershov 2003: 222-237 [doi]

Upper Bounds for a Theory of QueuesTatiana Rybina, Andrei Voronkov. icalp 2003: 714-724 [doi]

Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture)Tatiana Rybina, Andrei Voronkov. csl 2003: 546-573 [doi]

Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, ProceedingsMoshe Y. Vardi, Andrei Voronkov, editors, Volume 2850 of Lecture Notes in Computer Science, Springer, 2003.

Automated Reasoning: Past Story and New TrendsAndrei Voronkov. IJCAI 2003: 1607-1612

Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-UnificationAndrei Voronkov. JAR, 30(2):121-151, 2003.

2002

Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, ProceedingsMatthias Baaz, Andrei Voronkov, editors, Volume 2514 of Lecture Notes in Computer Science, Springer, 2002.

The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary SignaturesKonstantin Korovin, Andrei Voronkov. fsttcs 2002: 230-240 [doi]

The design and implementation of VAMPIREAlexandre Riazanov, Andrei Voronkov. aicom, 15(2-3):91-110, 2002. [doi]

BRAIN : Backward Reachability Analysis with IntegersTatiana Rybina, Andrei Voronkov. amast 2002: 489-494 [doi]

Using Canonical Representations of Solutions to Speed Up Infinite-State Model CheckingTatiana Rybina, Andrei Voronkov. cav 2002: 386-400 [doi]

Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, ProceedingsAndrei Voronkov, editor, Volume 2392 of Lecture Notes in Computer Science, Springer, 2002.

2001

Complexity and expressive power of logic programmingEvgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov. ACM Comput. Surv., 33(3):374-425, 2001. [doi]

Herbrand s Theorem and Equational Reasoning: Problems and SolutionsAnatoli Degtyarev, Yuri Gurevich, Andrei Voronkov. In Current Trends in Theoretical Computer Science. pages 303-326, 2001.

The Inverse MethodAnatoli Degtyarev, Andrei Voronkov. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 179-272, Elsevier and MIT Press, 2001.

Equality Reasoning in Sequent-Based CalculiAnatoli Degtyarev, Andrei Voronkov. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 611-706, Elsevier and MIT Press, 2001.

Term-Modal LogicsMelvin Fitting, Lars Thalmann, Andrei Voronkov. sLogica, 69(1):133-169, 2001.

Knuth-Bendix Constraint Solving Is NP-CompleteKonstantin Korovin, Andrei Voronkov. icalp 2001: 979-992 [doi]

Verifying Orientability of Rewrite Rules Using the Knuth-Bendix OrderKonstantin Korovin, Andrei Voronkov. RTA 2001: 137-153 [doi]

On the Evaluation of Indexing Techniques for Theorem ProvingRobert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, Andrei Voronkov. cade 2001: 257-271 [doi]

Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, ProceedingsRobert Nieuwenhuis, Andrei Voronkov, editors, Volume 2250 of Lecture Notes in Computer Science, Springer, 2001.

Term IndexingI. V. Ramakrishnan, R. C. Sekar, Andrei Voronkov. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 1853-1964, Elsevier and MIT Press, 2001.

Splitting Without BacktrackingAlexandre Riazanov, Andrei Voronkov. IJCAI 2001: 611-617

Vampire 1.1 (System Description)Alexandre Riazanov, Andrei Voronkov. cade 2001: 376-380 [doi]

Adaptive Saturation-Based ReasoningAlexandre Riazanov, Andrei Voronkov. ershov 2001: 95-108 [doi]

Handbook of Automated Reasoning (in 2 volumes)John Alan Robinson, Andrei Voronkov, editors, Elsevier and MIT Press, 2001.

A decision procedure for term algebras with queuesTatiana Rybina, Andrei Voronkov. tocl, 2(2):155-181, 2001. [doi]

Algorithms, Datastructures, and other Issues in Efficient Automated DeductionAndrei Voronkov. cade 2001: 13-28 [doi]

How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculiAndrei Voronkov. tocl, 2(2):182-215, 2001. [doi]

2000

Expressive Power and Data Complexity of Query Languages for Trees and ListsEvgeny Dantsin, Andrei Voronkov. pods 2000: 157-165 [doi]

Stratified ResolutionAnatoli Degtyarev, Andrei Voronkov. cade 2000: 365-384

Decidability and complexity of simultaneous rigid E-unification with one variable and related resultsAnatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov. TCS, 243(1-2):167-184, 2000. [doi]

Term-Modal LogicsMelvin Fitting, Lars Thalmann, Andrei Voronkov. tableaux 2000: 220-236

A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix OrderingKonstantin Korovin, Andrei Voronkov. lics 2000: 291-302 [doi]

Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, ProceedingsMichel Parigot, Andrei Voronkov, editors, Volume 1955 of Lecture Notes in Computer Science, Springer, 2000.

Partially Adaptive Code TreesAlexandre Riazanov, Andrei Voronkov. jelia 2000: 209-223 [doi]

A Decision Procedure for Term Algebras with QueuesTatiana Rybina, Andrei Voronkov. lics 2000: 279-290 [doi]

Deciding K using inverse-KAndrei Voronkov. kr 2000: 198-209

How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent CalculiAndrei Voronkov. lics 2000: 401-412 [doi]

1999

A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and TreesEvgeny Dantsin, Andrei Voronkov. fossacs 1999: 180-196

Logic Programming and Automated Reasoning, 6th International Conference, LPAR 99, Tbilisi, Georgia, September 6-10, 1999, ProceedingsHarald Ganzinger, David A. McAllester, Andrei Voronkov, editors, Volume 1705 of Lecture Notes in Computer Science, Springer, 1999.

Monadic Simultaneous Rigid E-unificationYuri Gurevich, Andrei Voronkov. TCS, 222(1-2):133-152, 1999. [doi]

VampireAlexandre Riazanov, Andrei Voronkov. cade 1999: 292-296 [doi]

KK: a theorem prover for KAndrei Voronkov. cade 1999: 383-387 [doi]

The Ground-Negative Fragment of First-Order Logic Is Pi:::p:::::2::-CompleteAndrei Voronkov. JSYML, 64(3):984-990, 1999.

Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand TheoremAndrei Voronkov. TCS, 224(1-2):319-352, 1999. [doi]

PreviousNext