| # |  | Author/Editor | Year | | Title | |
|---|
| 4 |
 | Book |
| |
| 42 |
| |
| 9 |
| Proceedings |
| |
| 1 |
| |
| 429 |
| Proceedings Article |
| |
| 8 |
| Electronic Proceedings Article |
| |
| 2 |
| Poster |
| |
| 176 |
| |
| | Anderson, Penny
Basin, David A. | 2000 | | Program Development Schemata as Derived Rules
In: Journal of Symbolic Computation [30], 5-36 | |
| | Areces, Carlos
de Rijke, Maarten
de Nivelle, Hans | 2001 | | Resolution in modal, description and hybrid logic
In: Journal of Logic and Computation [11], 717-736 | |
| | Avenhaus, Jürgen
Hillenbrand, Thomas
Löchner, Bernd | 2003 |  | On Using Ground Joinable Equations in Equational Theorem Proving
In: Journal of Symbolic Computation [36], 217-233 | |
| | Ayari, Abdelwaheb
Basin, David A. | 2001 | | A Higher-order Interpretation of Deductive Tableau
In: Journal of Symbolic Computation [31], 487-520 | |
| | Baader, Franz
Ohlbach, Hans Jürgen | 1995 | | A Multi-Dimensional Terminological Knowledge Representation Language
In: Journal of Applied Non-Classical Logics [5], 153-198 | |
| | Bachmair, Leo
Ganzinger, Harald | 1998 | | Ordered Chaining Calculi for First-Order Theories of Transitive Relations
In: Journal of the ACM [45], 1007-1049 | |
| | Bachmair, Leo
Ganzinger, Harald | 1994 | | Rewrite-based equational theorem proving with selection and simplification
In: Journal of Logic and Computation [4], 217-247 | |
| | Bachmair, Leo
Ganzinger, Harald
Lynch, Christopher
Snyder, Wayne | 1995 | | Basic Paramodulation
In: Information and Computation [121], 172-192 | |
| | Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe | 1994 | | Refutational Theorem Proving for Hierarchic First-Order Theories
In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212 | |
| | Barnett, Richard
Basin, David A.
Hesketh, Jane | 1993 | | A Recursion Planning Analysis of Inductive Completion
In: Annals of Mathematics and Artificial Intelligence [8], 363-381 | |
| | Barth, Peter
Bockmayr, Alexander | 1998 | | Modelling Discrete Optimisation Problems in Constraint Logic Programming
In: Annals of Operations Research [81], 467-496 | |
| | Barth, Peter
Bockmayr, Alexander | 1995 | | Pseudo-Boolean Constraint Logic Programming
In: Computational Logic. The Newsletter of the European Network in Computational Logic [2], 52-53 | |
| | Basin, David A. | 1994 | | A Term Equality Problem Equivalent to Graph Isomorphism
In: Information Processing Letters [51], 61-66 | |
| | Basin, David A. | 1994 | | Generalized Rewriting in Type Theory
In: Journal of Information Processing and Cybernetics [30], 249-259 | |
| | Basin, David A.
Brown, G. M.
Leeser, M. E. | 1991 | | Formally Verified Synthesis of Combinational CMOS Circuits
In: Integration: The Intern. Journal of VLSI Design [11], 235-250 | |
| | 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.
Ganzinger, Harald | 2001 | | Automated Complexity Analysis Based on Ordered Resolution
In: Journal of the ACM [48], 70-109 | |
| | 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 | 1996 | | Adding Metatheoretic facilities to First-order Theories
In: Journal of Logic and Computation [6], 835-849 | |
| | Basin, David A.
Matthews, Seán
Viganò, Luca | 1998 | | Labelled Modal Logics: quantifiers
In: Journal of Logic, Language and Information [7], 237-263 | |
| | Basin, David A.
Matthews, Seán
Viganò, Luca | 1998 | | Natural Deduction for Non-Classical Logics
In: Studia Logica [60], 119-160 | |
| | Basin, David A.
Matthews, Seán
Viganò, Luca | 1997 | | Labelled Propositional Modal Logics: Theory and Practice
In: Journal of Logic and Computation [7], 685-717 | |
