Artificial intelligence, automated reasoning, and symbolic computation : joint international conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002 : proceedings

"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"--Publisher's description 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 AISC 2002, the 6th international conference on Arti?cial Intelligence and S- bolic Computation, and Calculemus 2002, the 10th symposium on the Integ- tion of Symbolic Computation and Mechanized Reasoning, were held jointly in Marseille, France on July 1–5, 2002. This event was organized by the three universities in Marseille together with the LSIS (Laboratoire des Sciences de l’Information et des Syst` emes). AISC 2002 was the latest in a series of specialized conferences founded by John Campbell and Jacques Calmet with the initial title “Arti?cial Intelligence and Symbolic Mathematical Computation” (AISMC) and later denoted “Art- cial Intelligence and Symbolic Computation” (AISC). The scope is well de?ned by its successive titles. AISMC-1 (1992), AISMC-2 (1994), AISMC-3 (1996), AISC’98, and AISC 2000 took place in Karlsruhe, Cambridge, Steyr, Plattsburgh (NY), and Madrid respectively. The proceedings were published by Springer-Verlag as LNCS 737, LNCS 958, LNCS 1138, LNAI 1476, and LNAI 1930 respectively. Calculemus 2002 was the 10th symposium in a series which started with three meetings in 1996, two meetings in 1997, and then turned into a yearly event in 1998. Since then, it has become a tradition to hold the meeting jointly with an event in either symbolic computation or automated deduction. Both events share common interests in looking at Symbolic Computation, each from a di?erent point of view: Arti?cial Intelligence in the more general case of AISC and Automated Deduction in the more speci?c case of Calculemus.

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.

Constitutes the proceedings of the joint International Conferences on Artificial Intelligence and Symbolic Computation, and Calculemus 2002, held in France in 2002. The 24 papers cover automated theorem proving, logical reasoning, mathematical modeling, algebraic computations and more. Logic programming languages have emerged during the early seventies with Prolog by Colmerauer and Kowalski being the by far most prominent example.