MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 1. by Names of First Author,Editor

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
#YearTitleType
3
Show details for van der Torrevan der Torre
11
Show details for van der Torre, Tanvan der Torre, Tan
1
Show details for van der Torre, Weydertvan der Torre, Weydert
2
Show details for VeanesVeanes
1
Show details for VeitVeit
1
Show details for ViganòViganò
10
Hide details for VorobyovVorobyov
2002The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213		Journal Article
2002$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479		Journal Article
1999Attachment 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
1998Attachment 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
1997The 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
1997The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305		Proceedings Article
1996An 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
1996On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161		Proceedings Article
1995Fsub 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
1995Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175		Proceedings Article
1
Show details for Vorobyov, VoronkovVorobyov, Voronkov
1
Show details for VoronkovVoronkov
1
Show details for Wagner, PodelskiWagner, Podelski
10
Show details for WaldmannWaldmann
3
Show details for WangWang
17
Show details for WeidenbachWeidenbach
1
Show details for Weidenbach, Afshordel, Brahm, Cohrs, Engel, Keen, Theobalt, TopićWeidenbach, Afshordel, Brahm, Cohrs, Engel, Keen, Theobalt, Topić
1
Show details for Weidenbach, Brahm, Hillenbrand, Keen, Theobalt, TopićWeidenbach, Brahm, Hillenbrand, Keen, Theobalt, Topić
1
Show details for Weidenbach, Gaede, RockWeidenbach, Gaede, Rock
1
Show details for Weidenbach, Meyer, Cohrs, Engel, KeenWeidenbach, Meyer, Cohrs, Engel, Keen
5
Show details for Werner, Bockmayr, KrischerWerner, Bockmayr, Krischer
23
Show details for WeydertWeydert
1
Show details for Weydert, Brewka, Witteveen (ed.)Weydert, Brewka, Witteveen (ed.)

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