6. AISC 2002: Marseille, France
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. Springer 2002 Lecture Notes in Computer Science ISBN 3-540-43865-3
Invited Talks
- Eugene C. Freuder: Constraint Acquisition. 1
- Alain Colmerauer: Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees. 2-3
- Thomas Sturm: Integration of Quantifier Elimination with Constraint Logic Programming. 7-11
AISC Regular Talks
- Madhu Chetty: Towards a Hybrid Symbolic/Numeric Computational Approach in Controller Design. 12-25
- Emanuel Kitzelmann, Ute Schmid, Martin Mühlpfordt, Fritz Wysotzki: Inductive Synthesis of Functional Programs. 26-37
- Begoña Herrero, Luis M. Laita, Eugenio Roanes-Lozano, Victor Maojo, Luis de Ledesma, José Crespo, Laura Laita: A Symbolic Computation-Based Expert System for Alzheimer's Disease Diagnosis. 38-50
- Elena Smirnova: Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic. 64-75
- John A. Campbell: Indefinite Integration as a Testbed for Developments in Multi-agent Systems. 102-116
- Andrew Hunter: Expression Inference - Genetic Symbolic Classification Integrated with Non-linear Coefficient Optimisation. 117-127
- Jacqueline Castaing: Non-commutative Logic for Hand-Written Character Modeling. 136-153
- Sophie Loriette-Rougegrez: From Numerical to Symbolic Data during the Recognition of Scenarii. 154-167
- Regina Bernhaupt, Jochen Pfalzgraf: On Mathematical Modeling of Networks and Implementation Aspects. 168-180
- Stefan Ratschan: Continuous First-Order Constraint Satisfaction. 181-195
- Martin Charles Golumbic, Assaf Siani: Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. 196-207
- Mohamed Tounsi: A Genetic-Based Approach for Satisfiability Problems. 208-216
- K. Subramani: On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. 217-230
Calculemus Regular Talks
- Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani: Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. 231-245
- Michael Beeson, Freek Wiedijk: The Meaning of Infinity in Calculus and Computer Algebra Systems. 246-258
- Simon Colton: Making Conjectures about Maple Functions. 259-274
- Andreas Meier, Volker Sorge, Simon Colton: Employing Theory Formation to Guide Proof Planning. 275-289
- Temur Kutsia: Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms. 290-304
- Silvio Ranise: Combining Generic and Domain Specific Reasoning by Using Contexts. 305-318
- Jürgen Zimmer, Louise A. Dennis: Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus. 319-331
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team