Artificial Intelligence and Symbolic Computation: 8th International Conference, AISC 2006 Beijing, China, September 20-22, 2006 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 8th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2006, held in Beijing, China in September 2006.

The 18 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 39 submissions. Based on heuristics and mathematical algorithmics, artificial intelligence and symbolic computation are two views and approaches for automating (mathematical) problem solving. The papers address all current aspects in the area of symbolic computing and AI: mathematical foundations, implementations, and applications in industry and academia. The papers are organized in topical sections on artificial intelligence and theorem proving, symbolic computation, constraint satisfaction/solving, and mathematical knowledge management.

Author(s): Arjeh M. Cohen (auth.), Jacques Calmet, Tetsuo Ida, Dongming Wang (eds.)
Series: Lecture Notes in Computer Science 4120 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006

Language: English
Pages: 269
Tags: Artificial Intelligence (incl. Robotics); Symbolic and Algebraic Manipulation; Numeric Computing; Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages

Front Matter....Pages -
Interactive Mathematical Documents....Pages 1-1
Algebra and Geometry....Pages 2-2
An Inductive Inference System and Its Rationality....Pages 3-17
Semantic Guidance for Saturation Provers....Pages 18-24
Labeled @-Calculus: Formalism for Time-Concerned Human Factors....Pages 25-39
Enhanced Theorem Reuse by Partial Theory Inclusions....Pages 40-52
Extension of First-Order Theories into Trees....Pages 53-67
The Confluence Problem for Flat TRSs....Pages 68-81
Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer....Pages 82-93
A New Definition for Passivity and Its Relation to Coherence....Pages 94-105
A Full System of Invariants for Third-Order Linear Partial Differential Operators....Pages 106-115
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial....Pages 116-130
Quantifier Elimination for Quartics....Pages 131-145
On the Mixed Cayley-Sylvester Resultant Matrix....Pages 146-159
Implicitization of Rational Curves....Pages 160-169
Operator Calculus Approach to Solving Analytic Systems....Pages 170-180
Solving Dynamic Geometric Constraints Involving Inequalities....Pages 181-195
Constraints for Continuous Reachability in the Verification of Hybrid Systems....Pages 196-210
Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances....Pages 211-225
Finding Relations Among Linear Constraints....Pages 226-240
A Search Engine for Mathematical Formulae....Pages 241-253
Hierarchical Representations with Signatures for Large Expression Management....Pages 254-268
Back Matter....Pages -