Artificial Intelligence and Symbolic Mathematical Computation de Jaques Calmet

Artificial Intelligence and Symbolic Mathematical Computation

Jaques Calmet

John A. Campbell

Jochen Pfalzgraf

en Limba Engleză Paperback – 11 sep 1996

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.

Citește tot Restrânge

Cuprins

Symbolic computation and teaching.- Analytica — An experiment in combining theorem proving and symbolic computation.- Document recognition, semantics, and symbolic reasoning in reverse engineering of software.- Compromised updates in labelled databases.- An inference engine for propositional two-valued logic based on the radical membership problem.- Programming by demonstration: A machine learning approach to support skill acquision for robots.- Knowledge-based information processing in manufacturing cells — The present and the future.- Calculi for qualitative spatial reasoning.- Combining local consistency, symbolic rewriting and interval methods.- Proof transformation for non-compatible rewriting.- PATCH Graphs: An efficient data structure for completion of finitely presented groups.- Measuring the likely effectiveness of strategies.- A new approach on solving 3-satisfiability.- Geometry machines: From AI to SMC.- Interactive Theorem Proving and finite projective planes.- Towards modelling the topology of homogeneous manifolds by means of symbolic computation.- Solving geometrical constraint systems using CLP based on linear constraint solver.- Towards a sheaf semantics for cooperating agents scenarios.- Data types in subdefinite models.- On theorem-proving in Horn theories with built-in algebras.- Backward reasoning in systems with cut.- Soundness and completeness versus lifting property.- Reasoning with preorders and dynamic sorts using free variable tableaux.