Bruno Buchberger / John A. Campbell (eds.)

Artificial Intelligence and Symbolic Computation

7th International Conference, AISC 2004 Linz, Austria, September 22¿24, 2004 Proceedings
Herausgegeben:Buchberger, Bruno; Campbell, John A.

• Broschiertes Buch

Produktbeschreibung

AISC 2004, the 7th International Conference on Arti?cial Intelligence and S- bolicComputation,wasthelatestintheseriesofspecializedbiennialconferences foundedin1992byJacquesCalmetoftheUniversitat KarlsruheandJohnCa- bell of University College London with the initial title Arti?cial Intelligence and Symbolic Mathematical Computing (AISMC).TheM disappeared from the title between the 1996 and 1998 conferences. As the editors of the AISC 1998 p- ceedings said, the organizers of the current meeting decided to drop the adjective mathematical and toemphasize that the conference is concerned with all aspects of symbolic computation in AI: mathematical foundations, implementations, and applications, including applications in industry and academia. This remains the intended pro?le of the series, and will ?gure in the call for papersfor AISC 2006,whichis intended to takeplaceinChina. Thedistribution of papers in the present volume over all the areas of AISC happens to be rather noticeably mathematical, an e?ect that emerged because we were concerned to select the best relevant papers that were o?ered to us in 2004, irrespective of their particular topics; hence the title on the cover. Nevertheless, we encourage researchersovertheentirespectrumofAISC,asexpressedbythe1998quotation above,to be intouchwith us abouttheir interestsandthe possibility ofeventual submission of papers on their work for the next conference in the series. The papers in the present volume are evidence of the health of the ?eld of AISC. Additionally, there are two reasons for optimism about the continuation of this situation.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 3249
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 11318781, 978-3-540-23212-4
• Softcover reprint of the original 1st ed. 2004
• Seitenzahl: 300
• Erscheinungstermin: 10. September 2004
• Englisch
• Abmessung: 235mm x 155mm x 17mm
• Gewicht: 460g
• ISBN-13: 9783540232124
• ISBN-10: 3540232125
• Artikelnr.: 14746271

Autorenporträt

Bruno Buchberger, University of Linz, Austria / John A. Campbell, University College London, UK

Inhaltsangabe

Invited Presentations.- The Algorithmization of Physics: Math Between Science and Engineering.- Finite Algebras and AI: From Matrix Semantics to Stochastic Local Search.- Proof Search in Minimal Logic.- Planning and Patching Proof.- Papers.- A Paraconsistent Higher Order Logic.- Abstraction Within Partial Deduction for Linear Logic.- A Decision Procedure for Equality Logic with Uninterpreted Functions.- Generic Hermitian Quantifier Elimination.- Extending Finite Model Searching with Congruence Closure Computation.- On the Combination of Congruence Closure and Completion.- Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniques.- Proving and Constraint Solving in Computational Origami.- An Evolutionary Local Search Method for Incremental Satisfiability.- Solving Equations Involving Sequence Variables and Sequence Functions.- Verified Computer Algebra in Acl2.- Polynomial Interpretations with Negative Coefficients.- New Developments in Symmetry Breaking in Search Using Computational Group Theory.- Recognition of Whitehead-Minimal Elements in Free Groups of Large Ranks.- Four Approaches to Automated Reasoning with Differential Algebraic Structures.- Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy.- An Expert System on Detection, Evaluation and Treatment of Hypertension.- Short Presentations.- Two Revision Methods Based on Constraints: Application to a Flooding Problem.- Abstraction-Driven Verification of Array Programs.- Singularities in Qualitative Reasoning.- From a Computer Algebra Library to a System with an Equational Prover.