Publications

Publications

Server halma.mpi-inf.mpg.de

Entries sorted by: IMPRS 1st Report

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

Author/Editor

Title

Type

In Journals and Book Chapters

In Conference Proceedings

[1]

B. Afshordel, T. Hillenbrand and C. Weidenbach

First-Order Atom Definitions Extended
In: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-2001), 309-319

Proceedings Article

[2]

W. Backes and S. Wetzel

Lattice Basis Reduction with Dynamic Approximation
In: Proceedings of the 4th Workshop On Algorithm Engineering (WAE-2000), 63-73

Proceedings Article

[3]

W. Backes and S. Wetzel

New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152

Proceedings Article

[4]

J. Gaillourdet, T. Hillenbrand, B. Löchner and H. Spies

The New WALDMEISTER Loop at Work
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 317-321

Proceedings Article

[5]

H. Ganzinger, T. Hillenbrand and U. Waldmann

Superposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196

Proceedings Article

[6]

H. Ganzinger and K. Korovin

New Directions in Instantiation-Based Theorem Proving
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 55-64

Proceedings Article

[7]

M. Göbel and P. Maier

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

Proceedings Article

[8]

T. Hillenbrand

A Superposition View on Nelson-Oppen
In: Contributions to the Doctoral Programme of the 2nd International Joint Conference on Automated Reasoning, 16-20

Electronic Proceedings Article

[9]

T. Hillenbrand

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

Electronic Proceedings Article

[10]

T. Hillenbrand and B. Löchner

The Next WALDMEISTER Loop
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 486-500

Proceedings Article

[11]

T. Hillenbrand and B. Löchner

The Next WALDMEISTER Loop (Extended Abstract)
In: Proceedings of the Second International Workshop on the Implementation of Logics, IWIL 2001, 13-21

Proceedings Article

[12]

T. Hillenbrand, A. Podelski and D. Topić

Is Logic Effective for Analyzing C Programs?
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 27-30

Proceedings Article

[13]

Y. Kazakov

A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment
In: Logics in artificial intelligence : 9th European Conference, JELIA 2004, 372-384

Proceedings Article

[14]

Y. Kazakov

Recursive resolution for modal logic
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 11-15

Proceedings Article

[15]

Y. Kazakov and H. de Nivelle

A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 122-136

Proceedings Article

[16]

Y. Kazakov and H. de Nivelle

Subsumption of Concepts in $FL_0$ for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
In: 2003 International Workshop on Description Logics (DL-03), 56-64

Proceedings Article

[17]

K. Korovin and A. Voronkov

AC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59

Proceedings Article

[18]

K. Korovin and A. Voronkov

Orienting Equalities with the Knuth-Bendix Order
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84

Proceedings Article

[19]

P. Maier

A Framework for Circular Assume-Guarantee Rules
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 55-58

Proceedings Article

[20]

P. Maier

A Set-Theoretic Framework for Assume-Guarantee Reasoning
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-2001), 821-834

Proceedings Article

[21]

P. Maier

Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 343-357

Proceedings Article

[22]

C. Weidenbach, U. Brahm, T. Hillenbrand, E. Keen, C. Theobalt and D. Topić

SPASS Version 2.0
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 275-279

Proceedings Article

Thesis - Masters thesis

Thesis - PhD thesis

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

Imprint / Impressum | Data Protection / Datenschutzhinweis