Artificial Intelligence, Automated Reasoning, and Symbolic Computation [electronic resource] :Joint International Conferences AISC 2002 and Calculemus 2002 Marseille, France, July 1–5, 2002 Proceedings /
Contributor(s): Calmet, Jacques [editor.] | Benhamou, Belaid [editor.] | Caprotti, Olga [editor.] | Henocque, Laurent [editor.] | Sorge, Volker [editor.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 2385Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: XIV, 350 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540454700.Subject(s): Computer science | Mathematical logic | Numerical analysis | Computer science -- Mathematics | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Symbolic and Algebraic Manipulation | Numeric Computing | Discrete Mathematics in Computer Science | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
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 Domain Specific 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.