Location
Toggle navigation
HOME
INSTITUTE
Mission
Address
Executive Board
Scientific Members of MPG
Scientific Advisory Board
Board of Trustees
NEWS
Overview
Press Releases
Awards
Spotlights
Campus Event Calendar
25th Anniversary
Employment
DEPARTMENTS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Grapics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
PUBLICATIONS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Graphics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
Research Reports
Scientific Advisory Board
Curatorship Board
25th anniversary
IMPRS-CS
PEOPLE
SOFTWARE
SERVICES
Joint Central Services
Joint Administration
- Library
- International Office
Joint Scientific IT and Technical Services
- Building and Technical Support
Research Coordination
Representative for Equal Opportunities
- Equal Opportunities
Representative for Severely Disabled Persons
Representative for Safety
Ombudsperson for
Good Scientific Practice
and Doctoral Research
Company Physician
CS@MPG
CS@SAAR
Saarland Informatics Campus
Computer Science Department,
Saarland University
Max Planck Institute for
Software Systems (MPI-SWS)
German Center for
Artificial Intelligence (DFKI)
Center for Security, Privacy
and Accountability (CISPA)
VIA - Saarbrücken Center for
Visual Computing, Interaction
and Artificial Intelligence
Graduate School for
Computer Science
Cluster of Excellence (MMCI)
Max Planck Center for Visual
Computing and Communication
Kaiserslautern-Saarbrücken
Computer Science Cluster
IT Incubator
Publications
Home
Intranet
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
Toggle navigation
Show...
all entries of
this year (2024)
last year (2023)
two years ago (2022)
View...
all entries sorted by
Authors/Editors names
BibTeX citation keys
Type of Publication
only of type thesis
Years published
Submit
Find
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
#
Year
Title
Type
2
Talbot
1
Talbot, Devienne, Tison
1
Talbot, Niehren, Müller
1
Thiebaux, Hoffmann, Nebel
1
Timm
1
Trueg, Hoffmann, Nebel
2
Tzakova
3
van der Torre
11
van der Torre, Tan
1
van der Torre, Weydert
2
Veanes
1
Veit
1
Viganò
10
Vorobyov
2002
The 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
1999
Subtyping 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
1998
$\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
1997
The 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
1997
The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305
Proceedings Article
1996
An 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
1996
On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161
Proceedings Article
1995
Fsub 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
1995
Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175
Proceedings Article
1
Vorobyov, Voronkov
1
Voronkov
1
Wagner, Podelski
10
Waldmann
3
Wang
17
Weidenbach
Previous
Page |
Next
Page |
Expand All
|
Collapse All
|
Search (Full Text)