| # |  | Author/Editor | Year | | Title | Publisher / Institution | |
|---|
| 1 |
 | Book |
| |
| 11 |
| |
| 3 |
| Proceedings |
| |
| 85 |
| |
| 43 |
 | Journal Article |
| |
| | Bachmair, Leo
Ganzinger, Harald | 1998 | | Ordered Chaining Calculi for First-Order Theories of Transitive Relations
In: Journal of the ACM [45], 1007-1049 | | |
| | Barth, Peter
Bockmayr, Alexander | 1998 | | Modelling Discrete Optimisation Problems in Constraint Logic Programming
In: Annals of Operations Research [81], 467-496 | Baltzer | |
| | Basin, David A.
Friedrich, Stefan | 1999 | | Modeling a Hardware Synthesis Methodology in Isabelle
In: Formal Methods in Systems Design [15], 99-122 | | |
| | Basin, David A.
Klarlund, Nils | 1998 | | Automata Based Symbolic Reasoning in Hardware Verification
In: Formal Methods in Systems Design [13], 255-288 | | |
| | Basin, David A.
Matthews, Seán
Viganò, Luca | 1998 | | Labelled Modal Logics: quantifiers
In: Journal of Logic, Language and Information [7], 237-263 | Kluwer | |
| | Basin, David A.
Matthews, Seán
Viganò, Luca | 1998 | | Natural Deduction for Non-Classical Logics
In: Studia Logica [60], 119-160 | Kluwer | |
| | Blackburn, Patrick
Tzakova, Miroslava | 1999 | | Hybrid Languages and Temporal Logic
In: Logic Journal of the IGPL [7], 27-54 | Oxford University Press | |
| | Blackburn, Patrick
Tzakova, Miroslava | 1998 | | Hybrid Completeness
In: Logic Journal of the IGPL [6], 625-650 | Oxford University Press | |
| | Blackburn, Patrick
Tzakova, Miroslava | 1998 | | Hybridizing Concept Languages
In: Annals of Mathematics and Artificial Intelligence [24], 23-49 | Baltzer | |
| | Bockmayr, Alexander
Eisenbrand, Friedrich
Hartmann, Mark
Schulz, Andreas S. | 1999 | | On the Chvátal Rank of Polytopes in the 0/1 Cube
In: Discrete Applied Mathematics [98], 21-27 | Elsevier | |
| | Bockmayr, Alexander
Kasper, Thomas | 1998 | | Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
In: INFORMS Journal on Computing [10], 287-300 | | |
| | Buchmann, Johannes
Eisenbrand, Friedrich | 1999 | | On Factor Refinement in Number Fields
In: Mathematics of Computation [68], 345-350 | AMS | |
| | Charatonik, Witold | 1998 | | An Undecidable Fragment of the Theory of Set Constraints
In: Information Processing Letters [68], 147-151 | Elsevier | |
| | Charatonik, Witold | 1998 | | Set Constraints in Some Equational Theories
In: Information and Computation [142], 40-75 | Academic Press | |
| | Delzanno, Giorgio
Galmiche, Didier
Martelli, Maurizio | 1999 | | A specification logic for concurrent object-oriented programming
In: Mathematical Structures in Computer Science [9], 253-286 | Cambridge University Press | |
| | Eisenbrand, Friedrich | 1999 | | On the Membership Problem for the Elementary Closure of a Polyhedron
In: Combinatorica [19], 297-300 | János Bolyai Mathematical Society | |
| | Frank, Ian
Basin, David A. | 1998 | | Search in Games with Incomplete Information: A Case Study Using Bridge Card Play
In: Artificial Intelligence [100], 87-123 | | |
| | Ganzinger, Harald | 1998 | | Preface
In: Theoretical Computer Science [208], 1 | Elsevier | |
| | Gurevich, Yuri
Veanes, Margus | 1999 | | Logic with Equality: Partisan Corroboration and Shifted Pairing
In: Information and Computation [152], 205-235 | Academic Press | |
| | Hustadt, Ullrich
Schmidt, Renate A. | 1999 | | An Empirical Analysis of Modal Theorem Provers
In: Journal of Applied Non-Classical Logics [9], 479-522 | Hermes | |
| | Krishna Rao, M. R. K. | 1998 | | Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86 | Elsevier | |
| | Krishna Rao, M. R. K. | 1997 | | A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213 | Elsevier | |
| | Letz, Reinhold
Weidenbach, Christoph | 1998 | | Paradigmen und Perspektiven der automatischen Deduktion
In: KI, Organ des Fachbereichs 1 "Künstliche Intelligenz'' der Gesellschaft für Informatik e.V. [4], 15-19 | | |
| | Matthews, Seán
Basin, David A. | 1998 | | Scoped Metatheorems
In: Electronic Notes in Computer Science [15], 1-14 | Elsevier | |
| | Nivat, Maurice
Podelski, Andreas | 1997 | | Minimal Ascending and Descending Tree Automata
In: SIAM Journal on Computing [26], 39-58 | | |
