( en | de | ru )

 

Disambiguation of "Voronkov, Andrei"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity and expressive power of logic programming.

, , , and . ACM Comput. Surv., 33 (3): 374-425 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrei Verbovsky

Andrei Munk

Andrei Vescan

Andrei Komnick

Andrei Lehmann

 

Other publications of authors with the same name

On Computability by Logic Programs.. Structural Complexity and Recursion-theoretic methods in Logic-Programming, page 165-. Mathematical Sciences Institute, Cornell University, (1992)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)Expressive Power and Data Complexity of Query Languages for Trees and Lists., and . PODS, page 157-165. ACM, (2000)Knuth-Bendix constraint solving is NP-complete, and . CoRR, (2002)The Undecidability of Simultaneous Rigid E-Unification., and . Theor. Comput. Sci., 166 (1&2): 291-300 (1996)The design and implementation of VAMPIRE., and . AI Commun., 15 (2-3): 91-110 (2002)Logic Programming with Bounded Quantifiers.. RCLP, volume 592 of Lecture Notes in Computer Science, page 486-514. Springer, (1991)Simultaneous Regid E-Unification Is Undecidable., and . CSL, volume 1092 of Lecture Notes in Computer Science, page 178-190. Springer, (1995)EPR-Based Bounded Model Checking at Word Level., , , , and . IJCAR, volume 7364 of Lecture Notes in Computer Science, page 210-224. Springer, (2012)Proof Systems for Effectively Propositional Logic., and . IJCAR, volume 5195 of Lecture Notes in Computer Science, page 426-440. Springer, (2008)