| # | Y |  | Author/Editor | | Title | |
|---|
| 1 |
 | 2013 |
| |
| 2 |
| |
| 16 |
| 2007 |
| |
| 43 |
| |
| 41 |
| 2005 |
| |
| 37 |
| |
| 36 |
| 2003 |
| |
| 39 |
| |
| 58 |
| 2001 |
| |
| 48 |
| |
| 4 |
|
| Part of a Book |
| |
| 1 |
|
| |
| 19 |
|
 | Proceedings Article |
| |
| | | Backes, Werner
Wetzel, Susanne | | New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152 | |
| | | Charatonik, Witold | | Directional Type Checking for Logic Programs: Beyond Discriminative Types
In: Proceedings of the 8th European Symposium on Programming (ESOP-00), 72-87 | |
| | | Charatonik, Witold
Podelski, Andreas
Talbot, Jean-Marc | | Paths vs. Trees in Set-based Program Analysis
In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), 330-337 | |
| | | de Nivelle, Hans | | An Overview of Resolution Decision Procedures
In: Formalizing the Dynamics of Information, 115-130 | |
| | | de Nivelle, Hans
Bezem, Marc
Hendriks, Dimitri | | Automated Proof Construction in Type Theory Using Resolution
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 148-163 | |
| | | Delzanno, Giorgio
Raskin, Jean-François | | Symbolic Representation of Upward-Closed Sets
In: Proceedings of the 6th Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS-00); Held as Part of the European Joint Conferences on the Theory and Practice of Software (ETAPS-00), 426-440 | |
| | | Eisenbrand, Friedrich
Bockmayr, Alexander | | Combining logic and optimization in cutting plane theory
In: Proceedings of the Workshop on Frontiers of Combining Systems (FROCOS-2000), 1-17 | |
| | | Esparza, Javier
Podelski, Andreas | | Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs
In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), 1-11 | |
| | | Ganzinger, Harald
Sofronie-Stokkermans, Viorica |  | Chaining Techniques for Automated Theorem Proving in Many-Valued Logics
In: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL-00), 337-344 | |
| | | Göbel, Manfred
Maier, Patrick | | Three Remarks on Comprehensive Gröbner and SAGBI Bases
In: Proceedings of the 3rd Workshop on Computer Algebra in Scientific Computing (CASC-2000), 191-202 | |
| | | Mukhopadhyay, Supratik
Podelski, Andreas | | Model Checking for Timed Logic Processes
In: Proceedings of the 1st International Conference on Computational Logic, 598-612 | |
| | | Podelski, Andreas | | Model Checking as Constraint Solving
In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), 221-237 | |
| | | Sofronie-Stokkermans, Viorica | | On unification for bounded distributive lattices
In: Proceedings of the 17th International Conference on Automated Deduction (CADE-17), 465-481 | |
| | | Sofronie-Stokkermans, Viorica | | Resolution-based theorem proving for SHn-logics
In: Automated Deduction in Classical and Non-Classical Logic (Selected Papers of FTP'98), 268-282 | |
| | | Stuber, Jürgen | | Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
In: Proceedings of the 11th International Conference Rewriting Techniques and Applications (RTA-00), 229-245 | |
| | | Talbot, Jean-Marc | | On the Alternation-free Horn mu-calculus
In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR-2000), 418-435 | |
| | | Weydert, Emil | | How to revise ranked probabilities
In: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-00), 38-42 | |
