MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: Download

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
FilenameSize (KB)Can be sorted ascendingAccessTypeAuthor(s) [non member]TitleYear
gjoin.ps264Public
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.ps511
Thesis - Master's thesisGaede, BerndSuperposition Extended with Sorts
Universität Kaiserslautern
1995
ftp98-lncs-selection.pdf253Public
Proceedings ArticleSofronie-Stokkermans, VioricaResolution-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.pdf253Public
ReportSofronie-Stokkermans, VioricaResolution-based Theorem Proving for SHn-Logics1998
final_summaries.ps165Intranet
Proceedings ArticlePodelski, 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.pdf148Public
Proceedings ArticleWies, 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.ps171
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.pdf197Public
Proceedings ArticleFreiheit, 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.gz250Public
Thesis - Master's thesisEngel, ThorstenQuantifier Elimination in Second-Order Predicate Logic
Universität des Saarlandes
1996
ecsqaru03final.ps123MPG
Proceedings ArticleJaeger, ManfredA Representation Theorem and Applications
In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty :
7th European Conference, ECSQARU 2003, 50-61
2003
diss.pdf665
Thesis - Doctoral dissertationMaier, PatrickA Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes
2003
dissview.dvi892
Thesis - Doctoral dissertationBaumeister, HubertRelations between Abstract Datatypes modeled as Abstract Datatypes
Universität des Saarlandes
1999
DiplomRybalchenko.ps437Public
Thesis - Master's thesisRybalchenko, AndreyA Model Checker based on Abstraction Refinement
Universität des Saarlandes
2002
DIPLOM-90.ps601
Thesis - Master's thesisBaumeister, HubertÜber die Stabilität parameterisierter algebraischer Spezifikationen
Universität Dortmund
1990
deraedtl_inductive.ps181MPG
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.ps197
Proceedings ArticleVorobyov, SergeiSubtyping 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.ps357Public
Electronic Proceedings ArticleHillenbrand, ThomasCitius 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.pdf248Public
Proceedings ArticleSofronie-Stokkermans, VioricaOn 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.ps208
Proceedings ArticleMukhopadhyay, 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.ps736
Thesis - Master's thesisBecker, JoachimEffiziente Subsumption in Deduktionssystemen
Universität des Saarlandes
1994
bach.ps510Public
Thesis - Master's thesisBach, AlexanderStatic analysis of functional programs via Linear Logic
Universität des Saarlandes
1996
ATTSH4YZ.gz70
70
Public
Proceedings ArticleJaeger, ManfredReasoning 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.ps547
Proceedings ArticleAfshordel, 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.ps81Public
Proceedings ArticleHillenbrand, 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.pdf286Public
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.pdf400MPG
Journal ArticleJaeger, ManfredComplex Probabilistic Modeling with Recursive Relational Bayesian Networks
In: Annals of Mathematics and Artificial Intelligence [32], 179-220
2001
aij00.ps.gz77MPG
Journal ArticleJaeger, ManfredOn the complexity of inference about probabilistic relational models
In: Artificial Intelligence [117], 297-308
2000
abdelwaheb.ps848Public
Thesis - Master's thesisAyari, AbdelwahebA Reinterpretation of the Deductive Tableaux System in Higher-Order Logic
Universität des Saarlandes
1995
99LICS_2_ps.gz127
56
Public
Proceedings ArticleGanzinger, Harald
de Nivelle, Hans
A Superposition Decision Procedure for the Guarded Fragment with Equality
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 295-303
1999
99LICS_2.pdf127
56
Public
Proceedings ArticleGanzinger, Harald
de Nivelle, Hans
A Superposition Decision Procedure for the Guarded Fragment with Equality
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 295-303
1999

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