MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 4. BibTeX Citation Keys

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)


Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
BibTeX cite keyAuthor/EditorYearTitleType
Veanes98Veanes, Margus1998The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 264-275		Proceedings Article
Veanes99Veanes, Margus2000Farmer's Theorem Revisited
In: Information Processing Letters [74], 47-53		Journal Article
Veit1999Veit, Jörg1999Formal Fairness Proofs for Optimistic Contract Signing Protocols
Universität des Saarlandes		Thesis - Masters thesis
Vigano97Viganò, Luca1997A Framework for Non-Classical Logics
Universität des Saarlandes		Thesis - PhD thesis
Vorobyov1998CSLVorobyov, Sergei1999Attachment IconSubtyping Functional+Nonempty Record Types
In: Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, 285-297		Proceedings Article
Vorobyov1998MFCSVorobyov, Sergei1998Attachment Icon$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard
In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606		Proceedings Article
Vorobyov2000-aecuVorobyov, Sergei2002$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479		Journal Article
Vorobyov2000-OSRVorobyov, Sergei2002The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213		Journal Article
Vorobyov94bVorobyov, Sergei1995Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S
In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73		Proceedings Article
Vorobyov94hVorobyov, Sergei1995Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175		Proceedings Article
Vorobyov96ASIAN96Vorobyov, Sergei1996On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161		Proceedings Article
Vorobyov96CADE96Vorobyov, Sergei1996An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287		Proceedings Article
Vorobyov97LICS97Vorobyov, Sergei1997The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305		Proceedings Article
Vorobyov97RTA97Vorobyov, Sergei1997The first-order theory of one step rewriting in linear noetherian systems is undecidable
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 254-268		Proceedings Article
VorobyovVoronkov1998PODSVorobyov, Sergei
Voronkov, Andrei		1998Attachment IconComplexity of Nonrecursive Logic Programs with Complex Values
In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), 244-253		Proceedings Article
Voronkov99Voronkov, Andrei1999The ground-negative fragment of first-order logics is $\pi^p_2$-complete
In: The Journal of Symbolic Logic [64], 984-990		Journal Article
Waldmann1997Waldmann, Uwe1997Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes		Thesis - PhD thesis
Waldmann1997FTPWaldmann, Uwe1997A Superposition Calculus for Divisible Torsion-Free Abelian Groups
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 130-134		Proceedings Article
Waldmann1998Waldmann, Uwe1998Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159		Proceedings Article
Waldmann1998IPLWaldmann, Uwe1998Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49		Journal Article
Waldmann1999LPARWaldmann, Uwe1999Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), 131-147		Proceedings Article
Waldmann2001IJCARWaldmann, Uwe2001Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241		Proceedings Article
Waldmann2002aJSCWaldmann, Uwe2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829		Journal Article
Waldmann2002bJSCWaldmann, Uwe2002Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861		Journal Article
Waldmann2002IUCWaldmann, Uwe2002A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12		Proceedings Article
Waldmann92aWaldmann, Uwe1992Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35		Journal Article
Wang97Wang, Yongge1997Randomization and Approximation Techniques in Computer Science
In: Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 209-225		Proceedings Article
WangIPL96aWang, Yongge1997NP-hard sets are superterse unless NP is small
In: Information Processing Letters [61], 1-6		Journal Article
WangTCS96Wang, Yongge1999Randomness, Stochasticity, and Approximation
In: Theory of Computing Systems [32], 517-529		Journal Article
WBH+02-CADE18Weidenbach, Christoph
Brahm, Uwe
Hillenbrand, Thomas
Keen, Enno
Theobalt, Christian
Topić, Dalibor		2002Attachment IconSPASS Version 2.0
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 275-279		Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)