Symbolic computation and automated reasoning. The CALCULEMUS-2000 symposium. 8th symposium on the integration of symbolic computation and mechanized reasoning, St. Andrews, Scotland, GB, August 6--7, 2000 (Q2716041)

From MaRDI portal





scientific article; zbMATH DE number 1601015
Language Label Description Also known as
English
Symbolic computation and automated reasoning. The CALCULEMUS-2000 symposium. 8th symposium on the integration of symbolic computation and mechanized reasoning, St. Andrews, Scotland, GB, August 6--7, 2000
scientific article; zbMATH DE number 1601015

    Statements

    30 May 2001
    0 references
    St. Andrews, Scotland (GB)
    0 references
    Proceedings
    0 references
    Symposium
    0 references
    CALCULEMUS-2000
    0 references
    Symbolic computation
    0 references
    Mechanized reasoning
    0 references
    0 references
    0 references
    0 references
    Symbolic computation and automated reasoning. The CALCULEMUS-2000 symposium. 8th symposium on the integration of symbolic computation and mechanized reasoning, St. Andrews, Scotland, GB, August 6--7, 2000 (English)
    0 references
    The articles of this volume will be reviewed individually.NEWLINENEWLINEIndexed articles:NEWLINENEWLINE\textit{Adams, Andrew A.}, Definite integration of parametric rational functions: Applying a DITLU, 3-17 [Zbl 0992.68242]NEWLINENEWLINE\textit{Arai, Noriko H.; Masukawa, Ryuji}, How to find symmetries hidden in combinatorial problems, 18-32 [Zbl 0986.68126]NEWLINENEWLINE\textit{Armando, Alessandro; Kohlhase, Michael; Ranise, Silvio}, Communication protocols for mathematical services based on KQML and OMRS, 33-48 [Zbl 0986.68003]NEWLINENEWLINE\textit{Armando, Alessandro; Zini, Daniele}, Interfacing computer algebra and deduction systems via the logic broker architecture, 49-64 [Zbl 1017.68167]NEWLINENEWLINE\textit{Bancerek, Grzegorz}, Development of the theory of continuous lattices in MIZAR, 65-80 [Zbl 0986.68127]NEWLINENEWLINE\textit{Benzmüller, Christoph; Sorge, Volker}, \(\Omega\)-ANTS -- An open approach at combining interactive and automated theorem proving, 81-97 [Zbl 0986.68128]NEWLINENEWLINE\textit{Buchberger, Bruno; Dupré, Claudio; Jebelean, Tudor; Kriftner, Franz; Nakagawa, Koji; Văsaru, Daniela; Windsteiger, Wolfgang}, The TH\(\exists\)OREM\(\forall\) project: A progress report, 98-113 [Zbl 1017.68110]NEWLINENEWLINE\textit{Caprotti, Olga; Oostdijk, Martijn}, How to formally and efficiently prove prime(2999), 114-125 [Zbl 0999.68264]NEWLINENEWLINE\textit{Degtyarev, Anatoli I.; Lyaletski, Alexander V.; Morokhovets, Marina K.}, On the EA-style integrated processing of self-contained mathematical texts, 126-141 [Zbl 0986.68129]NEWLINENEWLINE\textit{Jamnik, Mateja; Kerber, Manfred; Benzmüller, Christoph}, Towards learning new methods in proof planning, 142-158 [Zbl 0986.68130]NEWLINENEWLINE\textit{Konev, Boris; Jebelean, Tudor}, Using meta-variables for natural deduction in \textit{Theorema}, 159-174 [Zbl 0986.68131]NEWLINENEWLINE\textit{Meier, Andreas; Sorge, Volker}, Exploring properties of residue classes, 175-190 [Zbl 0986.68132]NEWLINENEWLINE\textit{Rudnicki, Piotr; Schwarzweller, Christoph; Trybulec, Andrzej}, Defining power series and polynomials in Mizar, 191-204 [Zbl 0986.68133]NEWLINENEWLINE\textit{Thompson, Simon}, Logic and dependent types in the Aldor computer algebra system, 205-233 [Zbl 0986.68171]
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references