


default search action
6th AISC 2002: Marseille, France
- Jacques Calmet, Belaid Benhamou, Olga Caprotti

, Laurent Henocque, Volker Sorge:
Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings. Lecture Notes in Computer Science 2385, Springer 2002, 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 - Eric Deplagne, Claude Kirchner:

Deduction versus Computation: The Case of Induction. 4-6 - 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 - Marc Aiguier, Diane Bahrami, Catherine Dubois:

On a Generalised Logicality Theorem. 51-63 - Elena Smirnova:

Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic. 64-75 - Robert M. Corless

, David J. Jeffrey:
The Wright omega Function. 76-89 - Rolf Nossum, Luciano Serafini:

Multicontext Logic for Semigroups of Contexts. 90-101 - 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 - Li Bai, Yihui Liu:

A Novel Face Recognition Method. 128-135 - 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 - Ayal Z. Pinkus, Serge Winitzki:

YACAS: A Do-It-Yourself Symbolic Algebra Environment. 332-336 - Florina Piroi

, Bruno Buchberger:
Focus Windows: A New Technique for Proof Presentation. 337-342

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














