( en | de | ru )

 

Disambiguation of "Voronkov, Andrei"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of Nonrecursive Logic Programs with Complex Values.

, and . PODS, page 244-253. ACM Press, (1998)

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 Munk

Andrei Lehmann

Andrei Belitski

Andrei Negoescu

Andrei Verbovsky

 

Other publications of authors with the same name

Preface., and . Handbook of Automated Reasoning, Elsevier and MIT Press, (2001)Partially Adaptive Code Trees., and . JELIA, volume 1919 of Lecture Notes in Computer Science, page 209-223. Springer, (2000)Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order., and . RTA, volume 2051 of Lecture Notes in Computer Science, page 137-153. Springer, (2001)Coming to Terms with Quantified Reasoning., , and . CoRR, (2016)Keynote talk: EasyChair.. ASE, page 3-4. ACM, (2014)Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking., and . CAV, volume 2404 of Lecture Notes in Computer Science, page 386-400. Springer, (2002)Upper Bounds for a Theory of Queues., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 714-724. Springer, (2003)Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture)., and . CSL, volume 2803 of Lecture Notes in Computer Science, page 546-573. Springer, (2003)Complexity of Some Problems in Modal and Intuitionistic Calculi., and . CSL, volume 2803 of Lecture Notes in Computer Science, page 397-412. Springer, (2003)Equality Elimination for the Tableau Method., and . DISCO, volume 1128 of Lecture Notes in Computer Science, page 46-60. Springer, (1996)