Artificial Intelligence, Automated Reasoning, and Symbolic Computation: Joint International Conferences AISC 2002 and Calculemus 2002 Marseille, France, July 1–5, 2002 Proceedings

Eugene C. Freuder (auth.), Jacques Calmet, Belaid Benhamou, Olga Caprotti, Laurent Henocque, Volker Sorge (eds.)3540438653, 9783540438656

This book constitutes the refereed proceedings of the joint International Conferences on Artificial Intelligence and Symbolic Computation, AISC 2002, and Calculemus 2002 held in Marseille, France, in July 2002.
The 24 revised full papers presented together with 2 system descriptions were carefully reviewed and selected from 52 submissions. Among the topics covered are automated theorem proving, logical reasoning, mathematical modeling, algebraic computations, computational mathematics, and applications in engineering and industrial practice.

---

Table of contents :
Constraint Acquisition….Pages 1-1
Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees….Pages 2-3
Deduction versus Computation: The Case of Induction….Pages 4-6
Integration of Quantifier Elimination with Constraint Logic Programming….Pages 7-11
Towards a Hybrid Symbolic/Numeric Computational Approach in Controller Design….Pages 12-25
Inductive Synthesis of Functional Programs….Pages 26-37
A Symbolic Computation-Based Expert System for Alzheimer’s Disease Diagnosis….Pages 38-50
On a Generalised Logicality Theorem….Pages 51-63
Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic….Pages 64-75
The Wright ω Function….Pages 76-89
Multicontext Logic for Semigroups of Contexts….Pages 90-101
Indefinite Integration as a Testbed for Developments in Multi-agent Systems….Pages 102-116
Expression Inference — Genetic Symbolic Classification Integrated with Non-linear Coefficient Optimisation….Pages 117-127
A Novel Face Recognition Method….Pages 128-135
Non-commutative Logic for Hand-Written Character Modeling….Pages 136-153
From Numerical to Symbolic Data during the Recognition of Scenarii….Pages 154-167
On Mathematical Modeling of Networks and Implementation Aspects….Pages 168-180
Continuous First-Order Constraint Satisfaction….Pages 181-195
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints….Pages 196-207
A Genetic-Based Approach for Satisfiability Problems….Pages 208-216
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope….Pages 217-230
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements….Pages 231-245
The Meaning of Infinity in Calculus and Computer Algebra Systems….Pages 246-258
Making Conjectures about Maple Functions….Pages 259-274
Employing Theory Formation to Guide Proof Planning….Pages 275-289
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms….Pages 290-304
Combining Generic and Domain Specific Reasoning by Using Contexts….Pages 305-318
Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus….Pages 319-331
Yacas : A Do-It-Yourself Symbolic Algebra Environment….Pages 332-336
Focus Windows: A New Technique for Proof Presentation….Pages 337-341