Filename | Size (KB) | Access | Type | Author(s) [non member] | Title | Year |
|---|
| isa_mc_lpar05.pdf | 455 | Institute
| Proceedings Article | [Daum, Matthias]
Maus, Stefan
[Schirmer, Norbert]
Seghir, Mohammed Nassim | Integration of a Software Model Checker into Isabelle
In: Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005, 381-395 | 2005 |
| InstGen-final.pdf | 428 | Public
| Proceedings Article | Jacobs, Swen
Waldmann, Uwe | Comparing Instance Generation Methods for Automated Reasoning
In: Automated reasoning with analytic tableaux and related methods : International Conference, TABLEAUX 2005, 153-168 | 2005 |
| InstanceGenerationMethods.ps.gz | 316 | Public
| Thesis - Master's thesis | Jacobs, Swen | Instance Generation Methods for Automated Reasoning
Universität des Saarlandes | 2004 |
| ijcai01final.pdf | 108 | Public
| Proceedings Article | Jaeger, Manfred | Constraints as Data: a New Perspective on Inferring Probabilities
In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 755-760 | 2001 |
| gjoin.ps | 264 | Public
| Journal Article | [Avenhaus, Jürgen]
Hillenbrand, Thomas
[Löchner, Bernd] | On Using Ground Joinable Equations in Equational Theorem Proving
In: Journal of Symbolic Computation [36], 217-233 | 2003 |
| gaede.ps | 511 |
| Thesis - Master's thesis | Gaede, Bernd | Superposition Extended with Sorts
Universität Kaiserslautern | 1995 |
| ftp98-lncs-selection.pdf | 253 | Public
| Proceedings Article | 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 | 2000 |
| ftp-98.pdf | 253 | Public
| Report | Sofronie-Stokkermans, Viorica | Resolution-based Theorem Proving for SHn-Logics | 1998 |
| final_summaries.ps | 165 | Intranet
| Proceedings Article | Podelski, Andreas
Schaefer, Ina
Wagner, Silke | Summaries for While Programs with Recursion
In: Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, 94-107 | 2005 |
| field-constraint-analysis.pdf | 148 | Public
| Proceedings Article | Wies, Thomas
[Kuncak, Viktor]
[Lam, Patrick]
Podelski, Andreas
[Rinard, Martin C.] | Field Constraint Analysis
In: Verification, Model Checking, and Abstract Interpretation : 7th International Conference, VMCAI 2006, 157-173 | 2006 |
| evaluation.ps | 171 |
| Proceedings Article | [Nieuwenhuis, Robert]
Hillenbrand, Thomas
[Riazanov, Alexandre]
[Voronkov, Andrei] | On the Evaluation of Indexing Techniques for Theorem Proving
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271 | 2001 |
| EnhancedWorkflowModels.pdf | 197 | Public
| Proceedings Article | Freiheit, Jörn
[Münch, Susanne]
[Schöttle, Hendrik]
[Sijanski, Grozdana]
[Zangl, Fabrice] | Enhanced Workflow Models as a Tool for Judicial Practitioners
In: On the move to meaningful internet systems 2005: OTM 2005 Workshops : OTM Confederated International Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005, 26-27 | 2005 |
| engel.ps.gz | 250 | Public
| Thesis - Master's thesis | Engel, Thorsten | Quantifier Elimination in Second-Order Predicate Logic
Universität des Saarlandes | 1996 |
| ecsqaru03final.ps | 123 | MPG
| Proceedings Article | Jaeger, Manfred | A Representation Theorem and Applications
In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty :
7th European Conference, ECSQARU 2003, 50-61 | 2003 |
| diss.pdf | 665 |
| Thesis - Doctoral dissertation | Maier, Patrick | A Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes | 2003 |
| dissview.dvi | 892 |
| Thesis - Doctoral dissertation | Baumeister, Hubert | Relations between Abstract Datatypes modeled as Abstract Datatypes
Universität des Saarlandes | 1999 |
| DiplomRybalchenko.ps | 437 | Public
| Thesis - Master's thesis | Rybalchenko, Andrey | A Model Checker based on Abstraction Refinement
Universität des Saarlandes | 2002 |
| DIPLOM-90.ps | 601 |
| Thesis - Master's thesis | Baumeister, Hubert | Über die Stabilität parameterisierter algebraischer Spezifikationen
Universität Dortmund | 1990 |
| deraedtl_inductive.ps | 181 | MPG
| Proceedings Article | [de Raedt, Luc]
Jaeger, Manfred
[Lee, Sau Dan]
[Mannila, Heikki] | A Theory of Inductive Query Answering
In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), 123-130 | 2002 |
| csl98-final.ps | 197 |
| Proceedings Article | Vorobyov, Sergei | 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 | 1999 |
| citius.ps | 357 | Public
| Electronic Proceedings Article | Hillenbrand, Thomas | Citius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER
In: Proceedings of the 4th International Workshop on First Order Theorem Proving, FTP'03, 1-13 | 2003 |
| cade-99.pdf | 248 | Public
| Proceedings Article | Sofronie-Stokkermans, Viorica | On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 157-171 | 1999 |
| beyond.ps | 208 |
| Proceedings Article | Mukhopadhyay, Supratik
Podelski, Andreas | Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS-99), 232-244 | 1999 |
| becker.ps | 736 |
| Thesis - Master's thesis | Becker, Joachim | Effiziente Subsumption in Deduktionssystemen
Universität des Saarlandes | 1994 |
| bach.ps | 510 | Public
| Thesis - Master's thesis | Bach, Alexander | Static analysis of functional programs via Linear Logic
Universität des Saarlandes | 1996 |
| ATTSH4YZ.gz | 70
70 | Public
| Proceedings Article | Jaeger, Manfred | Reasoning About Infinite Random Structures with Relational Bayesian Networks
In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), 570-581 | 1998 |
| AtomFinal.ps | 547 |
| Proceedings Article | Afshordel, Bijan
Hillenbrand, Thomas
Weidenbach, Christoph | First-Order Atom Definitions Extended
In: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-2001), 309-319 | 2001 |
| analysis.ps | 81 | Public
| Proceedings Article | Hillenbrand, Thomas
Podelski, Andreas
Topić, Dalibor | Is Logic Effective for Analyzing C Programs?
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 27-30 | 2002 |
| An Abstract Model of Routing in Mobile Ad Hoc Networks.pdf | 286 | Public
| Proceedings Article | [Yuan, Cong]
[Billington, Jonathan]
Freiheit, Jörn | An Abstract Model of Routing in Mobile Ad Hoc Networks
In: Sixth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, 137-156 | 2005 |
| amai.pdf | 400 | MPG
| Journal Article | Jaeger, Manfred | Complex Probabilistic Modeling with Recursive Relational Bayesian Networks
In: Annals of Mathematics and Artificial Intelligence [32], 179-220 | 2001 |
