MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 5. Year - 8. Counting Publications

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
#YAuthor/EditorTitle
1
Show details for 20132013
2
Show details for 20092009
16
Show details for 20072007
43
Show details for 20062006
41
Show details for 20052005
37
Show details for 20042004
36
Show details for 20032003
39
Show details for 20022002
58
Show details for 20012001
48
Hide details for 20002000
4
Show details for Part of a BookPart of a Book
1
Show details for ProceedingsProceedings
19
Show details for Proceedings ArticleProceedings Article
1
Show details for Electronic Proceedings ArticleElectronic Proceedings Article
20
Hide details for Journal ArticleJournal Article
Anderson, Penny
Basin, David A.		Program Development Schemata as Derived Rules
In: Journal of Symbolic Computation [30], 5-36
Bugliesi, Michele
Delzanno, Giorgio
Liquori, Luigi
Martelli, Maurizio		Object Calculi in Linear Logic
In: Journal of Logic and Computation [10], 75-104
de Nivelle, HansDeciding the E-plus class by an a posteriori, liftable order
In: Annals of Pure and Applied Logic [88], 219-232
de Nivelle, Hans
Hustadt, Ullrich
Schmidt, Renate A.		Resolution-Based Methods for Modal Logics
In: Logic Journal of the IGPL [8], 265-292
Degtyarev, Anatoli
Gurevich, Yuri
Narendran, Paliath
Veanes, Margus
Voronkov, Andrei		Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results
In: Theoretical Computer Science [243], 167-184
Ganzinger, Harald
Jacquemard, Florent
Veanes, Margus		Rigid Reachability: The Non-Symmetric Form of Rigid E-unification
In: International Journal of Foundations of Computer Science [11], 3-27
Jaeger, ManfredAttachment IconOn the complexity of inference about probabilistic relational models
In: Artificial Intelligence [117], 297-308
Krishna Rao, M. R. K.Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164
Krishna Rao, M. R. K.Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223
Levy, Jordi
Veanes, Margus		On the Undecidability of Second-Order Unification
In: Information and Computation [159], 125-150
Lu, Mi
Wu, Jinzhao		On Theorem proving in Annotated Logics
In: Journal of Applied Non-Classical Logics [10], 121-143
Makinson, David
van der Torre, Leendert W. N.		Input-output logics
In: Journal of Philosophical Logic [29], 383-408
Matthews, Seán
Basin, David A.		Structuring Metatheory on Inductive Definitions
In: Information and Computation [162], 80-95
Müller, Martin
Niehren, Joachim
Podelski, Andreas		Ordering Constraints over Feature Trees
In: Constraints [5], 7-41
Sofronie-Stokkermans, VioricaAttachment IconDuality and Canonical Extensions of Bounded Distributive Lattices with Operators and Applications to the Semantics of Non-Classical Logics. Part I
In: Studia Logica [64], 93-132

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