Artificial Intelligence and Symbolic Mathematical Computation: International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings (Lecture Notes in Computer Science, 1138)

This book constitutes the refereed proceedings of the Third International Conference on Artificial Intelligence and Symbolic Mathematical Computation, AISMC-3, held in Steyr, Austria, in September 1996. The 19 revised full papers presented in the book were carefully selected by the program committee; also included are four invited survey and state-of-the-art contributions by Scott, Dillmann and Friedrich, Cohn, and Wang. Among the topics addressed are theorem proving, rewriting systems, symbolic computation, spatial reasoning, computational geometry, and automated deduction. Spine Title: Aismc-3 : Artificial Intelligence And Symbolic Mathematical Computation. Symbolic Computation And Teaching (invited Lecture) D.s. Scott -- Analytica : An Experiment In Combining Theorem Proving And Symbolic Computation / A. Bauer, E. Clarke, X. Zhao -- Document Recognition, Semantics, And Symbolic Reasoning In Reverse Engineering Of Software / G. Butler [and Others] -- Compromised Updates In Labelled Databases / F.c.c. Dargam -- An Inference Engine For Propositional Two-valued Logic Based On The Radical Membership Problem / E. Roanes-lozano, L.m. Laita, E. Roanes-macías -- Programming By Demonstration : A Machine Learning Approach To Support Skill Acquisition For Robots (invited Lecture) / R. Dillmann, H. Friedrich -- Knowledge-based Information Processing In Manufacturing Cells : The Present And The Future / G. Reinhart, R. Diesch, M.r. Koch -- Calculi For Qualitative Spatial Reasoning (invited Lecture) / A.g. Cohn -- Combining Local Consistency, Symbolic Rewriting And Interval Methods / F. Benhamou, L. Granvilliers --^ Proof Transformation For Non-compatible Rewriting / R. Bündgen -- Patch Graphs : An Efficient Data Structure For Completion Of Finitely Presented Groups / C. Lynch, P. Strogova -- Measuring The Likely Effectiveness Of Strategies / B.j. Dupée -- A New Approach On Solving 3-satisfiability / R. Rodošek -- Geometry Machines : From Aritifical Intelligence To Symbolic Mathematical Computation (invited Lecture) / D. Wang -- Interactive Theorem Proving And Finite Projective Planes / J. Ueberberg -- Towards Modelling The Topology Of Homogeneous Manifolds By Means Of Symbolic Computation / M. Joswig -- Solving Geometrical Constraint Systems Using Clp Based On Linear Constraint Solver / D. Bouhineau -- Towards A Sheaf Semantics For Cooperating Agents Scenarios / V. Sofronie -- Data Types In Subdefinite Models / V. Telerman, D. Ushakov -- On Theorem-proving In Horn Theories With Built-in Algebras / N. Andrianarivelo, W. Bousdira, J.-m. Talbot --^ Backward Reasoning In Systems With Cut / E. Eder -- Soundness And Completeness Versus Lifting Property / J.a. Plaza -- Reasoning With Preorders And Dynamic Sorts Using Free Variable Tableaux / A. Gavilanes [and Others]. Jacques Calmet, John A. Campbell, Jochen Pfalzgraf (eds.). Third International Conference On Artificial Intelligence And Symbolic Mathematical Computation (aismc-3), Held In Steyr (austria), September 23-25, 1996--foreword. Includes Bibliographical References And Index. Symbolic computation and teaching....Pages 1-20 Analytica — An experiment in combining theorem proving and symbolic computation....Pages 21-37 Document recognition, semantics, and symbolic reasoning in reverse engineering of software....Pages 38-48 Compromised updates in labelled databases....Pages 49-70 An inference engine for propositional two-valued logic based on the radical membership problem....Pages 71-86 Programming by demonstration: A machine learning approach to support skill acquision for robots....Pages 87-108 Knowledge-based information processing in manufacturing cells — The present and the future....Pages 109-123 Calculi for qualitative spatial reasoning....Pages 124-143 Combining local consistency, symbolic rewriting and interval methods....Pages 144-159 Proof transformation for non-compatible rewriting....Pages 160-175 PATCH Graphs: An efficient data structure for completion of finitely presented groups....Pages 176-190 Measuring the likely effectiveness of strategies....Pages 191-196 A new approach on solving 3-satisfiability....Pages 197-212 Geometry machines: From AI to SMC....Pages 213-239 Interactive Theorem Proving and finite projective planes....Pages 240-257 Towards modelling the topology of homogeneous manifolds by means of symbolic computation....Pages 258-273 Solving geometrical constraint systems using CLP based on linear constraint solver....Pages 274-288 Towards a sheaf semantics for cooperating agents scenarios....Pages 289-304 Data types in subdefinite models....Pages 305-319 On theorem-proving in Horn theories with built-in algebras....Pages 320-338 Backward reasoning in systems with cut....Pages 339-353 Soundness and completeness versus lifting property....Pages 354-364 Reasoning with preorders and dynamic sorts using free variable tableaux....Pages 365-379 In his keynote address at the Second Annual Conference on Technology in Collegiate Mathematics in November 1989 at The Ohio State University (see the newsletter UME TRENDS, for January 1990), Professor Lynn Steen effectively spoke for parents and students, scientists and engineers, colleagues and administrators by raising the following twenty questions for calculus reformers.