Jacques Calmet / Belaid Benhamou / Olga Caprotti / Laurent Henocque / Volker Sorge (eds.)

Artificial Intelligence, Automated Reasoning, and Symbolic Computation

Joint International Conferences, AISC 2002 and Calculemus 2002 Marseille, France, July 1-5, 2002 Proceedings
Herausgegeben:Calmet, Jacques; Benhamou, Belaid; Caprotti, Olga; Henocque, Laurent; Sorge, Volker

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 2385
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-43865-6
• 2002
• Seitenzahl: 364
• Erscheinungstermin: 19. Juni 2002
• Englisch
• Abmessung: 235mm x 155mm x 20mm
• Gewicht: 513g
• ISBN-13: 9783540438656
• ISBN-10: 3540438653
• Artikelnr.: 23380188

Autorenporträt

Jacques Calmet, University of Karlsruhe, Germany / Belaid Benhamou, Universite de Provence, Marseille, France / Olga Caprotti, Johannes Kepler University, Linz, Austria / Laurent Henocque, Universite de la Mediterannee, Marseille, France / Volker Sorge, University of Birmingham, UK

Inhaltsangabe

Invited Talks.- Constraint Acquisition.- Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees.- Deduction versus Computation: The Case of Induction.- Integration of Quantifier Elimination with Constraint Logic Programming.- AISC Regular Talks.- Towards a Hybrid Symbolic/Numeric Computational Approach in Controller Design.- Inductive Synthesis of Functional Programs.- A Symbolic Computation-Based Expert System for Alzheimer's Disease Diagnosis.- On a Generalised Logicality Theorem.- Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic.- The Wright ? Function.- Multicontext Logic for Semigroups of Contexts.- Indefinite Integration as a Testbed for Developments in Multi-agent Systems.- Expression Inference - Genetic Symbolic Classification Integrated with Non-linear Coefficient Optimisation.- A Novel Face Recognition Method.- Non-commutative Logic for Hand-Written Character Modeling.- From Numerical to Symbolic Data during the Recognition of Scenarii.- On Mathematical Modeling of Networks and Implementation Aspects.- Continuous First-Order Constraint Satisfaction.- Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints.- A Genetic-Based Approach for Satisfiability Problems.- On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope.- Calculemus Regular Talks.- Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements.- The Meaning of Infinity in Calculus and Computer Algebra Systems.- Making Conjectures about Maple Functions.- Employing Theory Formation to Guide Proof Planning.- Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms.- Combining Generic and DomainSpecific Reasoning by Using Contexts.- Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus.- Yacas: A Do-It-Yourself Symbolic Algebra Environment.- Focus Windows: A New Technique for Proof Presentation.