The PCS prover in TH ∃oREM ∀

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2178 LNCS, Issue , 2001, Pages 469-478

  Buchberger, Bruno ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; HEURISTIC METHODS; SYSTEM THEORY; COMPUTATION THEORY;

ELEMENTARY ANALYSIS; INFERENCE RULES; LIMIT THEOREM; NATURAL PROOFS; PREDICATE LOGIC;

COMPUTATION THEORY; HEURISTIC METHODS;

EID: 84887145464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45654-6_37     Document Type: Conference Paper

References (7)

1. B. Buchberger. Theory Exploration with Theorema. In: Proc. of the 2nd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2000), Dept. of Computer Science, Univ. of West Timisoara, Romania, Oct. 4-6, 2000, pp. 1-16.
2. B. Buchberger, T. Jebelean, F. Kriftner, M. Marin, D. Vasaru. An Overview on the Theorema project. In: Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC 97), Maui, Hawaii, July 21-23, 1997, W.Kuechlin (ed.), ACM Press 1997, pp. 384-391.
3. B. Buchberger, C. Dupre, T. Jebelean, F. Kriftner, K. Nakagawa, D. Vasaru, W. Windsteiger. The Theorema Project: A Progress Report. In: Proc. of the 8th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 2000), St. Andrews, Scotland, August 6?7, M. Kerber and M. Kohlhase (eds.), available from: Fachbereich Informatik, Universität des Saarlandes, pp. 100?115.
4. G. E. Collins. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. In: Second GI Conference on Automata Theory and Formal Languages, LNCS 33, pages 134?183, Springer Verlag, Berlin, 1975. Reprinted in [5], pp. 85?121.
5. B. F. Caviness, J. R. Johnson (eds.). Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation of the Research Institute for Symbolic Computation (B. Buchberger, G.E. Collins, eds.), Springer, Wien?New York, 431 pages.
6. D. Vasaru?Dupre. Automated Theorem Proving by Integrating Proving, Solving and Computing, PhD Thesis, April 2000, Research Institute for Symbolic Compuationat (RISC), Johannes Kepler University Linz, A?4232 Castle of Hagenberg, Austria.
7. W. Windsteiger. A Set Theory Prover in Theorema: Implementation and Practical Applications, PhD Thesis, May 2001, Research Institute for Symbolic Compuationat (RISC), Johannes Kepler University Linz, A?4232 Castle of Hagenberg, Austria.