The SFB program expired on September 30, 2008. For the link to the successor project click DK Computational Mathematics
Home
Appointments
Papers
Misc
Contact

Technical Reports

Publication Lists

Annual Reports


Publications of the Project F1302


InProceedingsReferred - 2002


September 27, 2008

Bibliography

1
B. Buchberger.
Invention by Lazy Thinking.
In R. Wagner, editor, ``A Min Tjoa @ Work''- In honor of the 50th birthday of Univ.Prof.Dr. A Min Tjoa, pages 11-31. Austrian Computer Society, December 2002.
2
A. Craciun and B. Buchberger.
Proving the correctness of the merge-sort algorithm with Theorema.
In Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'02), pages 97-111, Timisoara, Romania, October 2002.
ISBN 973-585-785-5.
3
T. Jebelean.
Nonconventional Algorithms for Multiprecision Arithmetic.
In V. Negru et al., editors, Proceeding of International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'02), pages 3-7, Timisoara, Romania, October 2002. Mirton.
4
G. Kusper.
Integrating Temporal Assertions into a Parallel Debugger.
In B. Monien and R. Feldmann, editors, Proceedings of the 8th International Euro-Par Conference, pages 113-120, Paderborn, Germany, 2002. Springer-Verlag.
5
T. Kutsia.
Theorem proving with sequence variables and flexible arity symbols.
In M. Baaz and A. Voronkov, editors, Logic in Programming, Artificial Intelligence and Reasoning. Proceedings of the 9th International Conference LPAR'02, volume 2514 of Lecture Notes in Artificial Intelligence, pages 278-291, Tbilisi, Georgia, October 14-18 2002. Springer Verlag.
ISBN 3-540-00010-0.
6
T. Kutsia.
Unification with sequence variables and flexible arity symbols and its extension with pattern-terms.
In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 - Calculemus'2002 conference, volume 2385 of Lecture Notes in Artificial Intelligence, pages 290-304, Marseille, France, July 2002. Springer Verlag.
ISBN 3-540-43865-3.
7
K. Nakagawa.
Variable Shape Logicographic Symbols.
In K. Nakagawa, editor, Logic, Mathematics and Computer Science: Interactions (LMCS 2002), pages 202-216, RISC, Schloss Hagenberg, Austria, October 2002.
8
F. Piroi.
Focus windows: A tool for automated provers.
In D. Petcu, V. Negru, D. Zaharie, and T. Jebelean, editors, Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'02), Timisoara, Romania, October 2002.
ISBN 973-585-785-5.
9
F. Piroi and B. Buchberger.
Focus windows: A new technique for proof presentation.
In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Artificial Intelligence, Automated Reasoning and Symbolic Computation. Proceedings of Joint AICS'2002 - Calculemus'2002 Conference., volume 2385 of Lecture Notes in Artificial Intelligence, pages 290-304, Marseille, France, July 2002. Springer Verlag.
ISBN 3-540-43865-3.
10
F. Piroi and B. Buchberger.
Focus Windows: A New Technique for Proof Presentation.
In H. Kredel and W. Seiler, editors, Proceedings of the 8th Rhine Workshop on Computer Algebra, Mannheim, Germany, pages 297-313, March 21-22 2002.
11
J. Robu.
Systematic exploration of geometric configurations using Mathematica.
In Analele Universitatii Timisoara, volume XXXIX of Seria Matematica-Informatica, pages 209-216, Timisoara, Romania, 2002.
12
M. Rosenkranz, B. Buchberger, and H. W. Engl.
Solving Linear Boundary Value Problems Via Non-commutative Gröbner Bases.
In D. Petcu, V. Negru, D. Zaharie, and T. Jebelean, editors, Proceedings of SYNASC 2002, 4th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing, pages 300-313, Timisoara, Romania, 9-12 October 2002. Mirton Publisher.
13
W. Windsteiger.
An Automated Prover for Set Theory in Theorema.
In O. Caprotti and V. Sorge, editors, Calculemus 2002, 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning: Work in Progress Papers, pages 56-67, Marseille, France, June 2002.
Appears in Seki-Report Series Nr. SR-02-04, Universität des Saarlandes.
14
W. Windsteiger.
An Automated Prover for Zermelo-Fraenkel Set Theory in Theorema.
In K. Nakagawa, editor, Logic, Mathematics and Computer Science: Interactions (LMCS 2002), pages 266-280, RISC, Schloss Hagenberg, Austria, October 2002.
Symposium in Honor of Bruno Buchberger's 60th Birthday, Appears in RISC-report Series Nr. 02-60.




Please direct your comments or eventual problem reports to webmaster.

SpezialForschungsBereich SFB F013 | Special Research Program of the FWF - Austrian Science Fund